Solves the N-Queens problem (where, in this program, 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?
-Written by Blair Tennessy.
+
+Written by Blair Tennessy; 2002.
</_description>
</screensaver>