X-Git-Url: http://git.hungrycats.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=hacks%2Fconfig%2Fglhanoi.xml;h=983321f5bb7753f6de27e73d0f7531353af118d4;hb=50be9bb40dc60130c99ffa568e6677779904ff70;hp=b6a189dac169af79ea40b442d5ec7ac69c21ad0d;hpb=ccb7f4903325f92555a9722bba74b58346654ba0;p=xscreensaver

diff --git a/hacks/config/glhanoi.xml b/hacks/config/glhanoi.xml
index b6a189da..983321f5 100644
--- a/hacks/config/glhanoi.xml
+++ b/hacks/config/glhanoi.xml
@@ -4,23 +4,37 @@
 
 	<command arg="-root"/>
 	
-	<number id="count" type="spinbutton" arg="-count %"
-	  _label="Number of Disks" default="7" low="2" high="200"/>
+	<number id="delay" type="slider" arg="-delay %"
+	  _label="Frame rate" _low-label="Low" _high-label="High"
+          low="0" high="100000" default="15000" convert="invert"/>
 	
+	<number id="count" type="slider" arg="-count %"
+	  _label="Number of disks" _low-label="0" _high-label="31"
+           default="0" low="0" high="31"/>
+
+	<number id="poles" type="slider" arg="-poles %"
+	  _label="Number of poles" _low-label="0" _high-label="31"
+           default="0" low="3" high="31"/>
+		   
+	<number id="speed" type="slider" arg="-speed %"
+	  _label="Speed (of smallest disks)" _low-label="1" _high-label="20"
+           default="1" low="1" high="20"/>
+		   
 	<boolean id="fog" _label="Enable fog" arg-set="-fog"/>
 
-	<boolean id="wire" _label="Wireframe" arg-set="-wire"/>
+	<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"/>
 
 	<boolean id="lighting" _label="Enable lighting" arg-unset="-no-light"/>
 
-	<number id="delay" type="slider" arg="-delay %"
-	  _label="Frame Delay (us)" _low-label="Slow" _high-label="Fast"
-          low="0" high="80000" default="15000" convert="invert"/>
-	
 	<_description>
-Solves the Towers of Hanoi puzzle. Move N disks from one pole to another, one disk at a time, with no disk ever resting on a disk smaller than itself.
-Written by Dave Atkinson.
+Solves the Towers of Hanoi puzzle. Move N disks from one pole to
+another, one disk at a time, with no disk ever resting on a disk
+smaller than itself.
+
+http://en.wikipedia.org/wiki/Tower_of_Hanoi
+
+Written by Dave Atkinson; 2005.
 	</_description>
 </screensaver>