-Solves the N-Queens problem (where N is between 5 and 10 queens). The
-problem is: how may one place N queens on an NxN chessboard such that
-no queen can attack a sister? See also the "Endgame" screen saver.
+The N-Queens problem: how to place N queens on an NxN chessboard
+such that no queen can attack a sister?
+
+See also the "Endgame" screen saver.