|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
Re: Efficient N-Queen solution with Perlby pjf (Curate) |
| on Nov 17, 2001 at 02:25 UTC ( #125946=note: print w/ replies, xml ) | Need Help?? |
|
Those poor monks who are wondering what on earth the N-Queen problem actually is, will probably be enlightened by looking here. In sort, place N queens on an N by N chessboard, such that no queen can take any other queen. The N-queen problem has been around for a while, as you probably guessed from the aforementioned page calling a 1977 article "recent".
Cheers,
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||