-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.
+
+Written by Dave Atkinson; 2005.