http://slackware.bholcomb.com/slackware/slackware-11.0/source/xap/xscreensaver/xscree...

[xscreensaver] / hacks / config / queens.xml

diff --git a/hacks/config/queens.xml b/hacks/config/queens.xml
index 7c52fcf4e4245d8d9b3fccfa321c273ae263141b..3796855009446e7d6e9ab35d2acdc1e372ec8fef 100644 (file)
--- a/hacks/config/queens.xml
+++ b/hacks/config/queens.xml
@@ -4,17 +4,21 @@
 
   <command arg="-root"/>
 
-  <number id="speed" type="slider" arg="-delay %"
+  <number id="delay" type="slider" arg="-delay %"
           _label="Speed" _low-label="Slow" _high-label="Fast"
           low="0" high="50000" default="20000"
           convert="invert"/>
 
-  <boolean id="showfps" _label="Show Frames-per-Second" arg-set="-fps"/>
+  <hgroup>
+   <boolean id="wire"    _label="Wireframe" arg-set="-wireframe"/>
+   <boolean id="showfps" _label="Show Frames-per-Second" 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?
-Written by Blair Tennessy.
+
+Written by Blair Tennessy; 2002.
   </_description>
 </screensaver>