Tower of Hanoi
Tower of Hanoi is a puzzle with three pegs and a stack of discs that get smaller toward the top. You must move the entire stack from its starting peg to the peg named on the screen. Only one disc moves at a time, only the top disc of a peg can be lifted, and a disc may never rest on a smaller disc. The first level uses three discs, which can be solved in seven moves, and the second level uses four discs, which need fifteen. Three stars are awarded only for the fewest possible moves, while a solution within one and a half times that still earns two. The puzzle is famous in mathematics and computing because its best solution follows a simple repeating pattern.
How to play
- Tap a peg to lift its top disc.
- Tap another peg to place the disc there.
- Never put a larger disc on a smaller one.
- Move the whole tower in the fewest moves for three stars.
Tips
- The smallest disc moves on every other turn, always around the pegs in the same direction.
- With an odd number of discs, start by moving the smallest disc straight to the target peg.