X-Git-Url: http://git.hungrycats.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=hacks%2Fconfig%2Fqueens.xml;h=3796855009446e7d6e9ab35d2acdc1e372ec8fef;hb=49f5b54f312fe4ac2e9bc47581a72451bd0e8439;hp=7c52fcf4e4245d8d9b3fccfa321c273ae263141b;hpb=13dbc569cdc6e29019722c0ef9b932a925efbcad;p=xscreensaver
diff --git a/hacks/config/queens.xml b/hacks/config/queens.xml
index 7c52fcf4..37968550 100644
--- a/hacks/config/queens.xml
+++ b/hacks/config/queens.xml
@@ -4,17 +4,21 @@
-
-
+
+
+
+
<_description>
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.