1. Click the “Green flag”: a help screen appears. Read the instructions carefully. 2. Click anywhere to continue. 3. Using the "Discs" slider pick the number of discs: 1 to 5. 4. Click "Setup" to arrange the discs on one of the rods. 5. Click “Solve” to make the computer solve the puzzle, or press SPACE BAR to move the discs yourself, one disc at a time.
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of discs of different sizes which can slide onto any rod. The puzzle starts with the discs 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 disc can be moved at a time. 2. A disk can only be moved if it is the uppermost disc on a stack. 3. You cannot place a bigger disc on top of a smaller disc.
