Towers of Hanoi Demo

The Towers of Hanoi puzzle consists of a set of disks which must moved from one pile to another. The rules state that only one disk can be moved at a time, and that a disk can only be placed on top of a disk larger than itself.

All the artwork for this Applet is stored in a file which is only 601 bytes long. This file, beside the artwork, also contains the information about the size of each disk (each disk can have a different thickness!) and the location of the three towers.