There's an essay on the J-wiki about this - http://www.jsoftware.com/jwiki/Essays/N_Queens_Problem - though I think it may have a mistake: aren't there 96 solutions if one counts all the rotations and reflections of the basic 12 (not 92 as stated in the essay)?
There's also a Dyalog solution: http://www.dyalog.dk/dfnsdws/n_queens.htm. I've seen the one-liner but don't recall in which issue of Vector. On 4/5/08, Dan Bron <[EMAIL PROTECTED]> wrote: > > > familiarity with the symbolism is crucial. > > > Absolutely (this is our common response to the "cryptic!" accusation). > > > > And I have a one line APL function for printing out all > > solutions for n queens on a board. > > > Send that along. I'd like to give a shot. > > > -Dan > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
