http://www.jwz.org/xscreensaver/xscreensaver-5.07.tar.gz

[xscreensaver] / hacks / config / queens.xml

diff --git a/hacks/config/queens.xml b/hacks/config/queens.xml
index 3796855009446e7d6e9ab35d2acdc1e372ec8fef..8aad759af47b352e628aefc8b7ac2b2bac2480a0 100644 (file)
--- a/hacks/config/queens.xml
+++ b/hacks/config/queens.xml
@@ -5,19 +5,21 @@
   <command arg="-root"/>
 
   <number id="delay" type="slider" arg="-delay %"
-          _label="Speed" _low-label="Slow" _high-label="Fast"
-          low="0" high="50000" default="20000"
+          _label="Frame rate" _low-label="Low" _high-label="High"
+          low="0" high="100000" default="20000"
           convert="invert"/>
 
   <hgroup>
    <boolean id="wire"    _label="Wireframe" arg-set="-wireframe"/>
-   <boolean id="showfps" _label="Show Frames-per-Second" arg-set="-fps"/>
+   <boolean id="showfps" _label="Show frame rate" arg-set="-fps"/>
   </hgroup>
 
   <_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?
+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.
+
+http://en.wikipedia.org/wiki/Eight_queens_puzzle
 
 Written by Blair Tennessy; 2002.
   </_description>