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,
Paul
In reply to Re: Efficient N-Queen solution with Perl
by pjf
in thread Efficient N-Queen solution with Perl
by lestrrat
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |