1. Click on the “Green flag”: a help screen appears. Read the instructions carefully. 2. Click anywhere to continue. 3. Press SPACE BAR to move one disk at a time.
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. A disk can only be moved if it is the uppermost disk on a stack. 3. You cannot place a bigger disk on top of a smaller disk.
