X-Git-Url: http://git.hungrycats.org/cgi-bin/gitweb.cgi?p=xscreensaver;a=blobdiff_plain;f=hacks%2Fconfig%2Fqueens.xml;h=3796855009446e7d6e9ab35d2acdc1e372ec8fef;hp=d90028460d9bae39909b31b3266f990bdc94881e;hb=49f5b54f312fe4ac2e9bc47581a72451bd0e8439;hpb=ccb7f4903325f92555a9722bba74b58346654ba0

diff --git a/hacks/config/queens.xml b/hacks/config/queens.xml
index d9002846..37968550 100644
--- a/hacks/config/queens.xml
+++ b/hacks/config/queens.xml
@@ -18,6 +18,7 @@
 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>