Towers of Hanoi
This is a classic puzzle involving moving disks from one peg to
another. Can you move a tower of disks, one at a time, from one peg to
another, without ever putting a disk on top of a smaller disk? If you
can, is there a maximum number of disks for which this can be done? How
many moves would it take? Is there a simple way of programming the
process?
Here's a movie of the process, in Breve.
This Breve code uses the following files:
Tower.tz
Disk.tz
main.tz