Tower of Hanoi Puzzle

Move the tower one disk at a time in the fewest moves. Free, no download, works on Chromebooks, tablets and phones.

Loading activity…

About this game

The Tower of Hanoi is a famous puzzle with a hidden pattern. Move the whole tower from the left peg to the right peg. You can only move one disk at a time, and a bigger disk can never sit on a smaller one. With 3 disks the best solution takes 7 moves. How many does 4 take? 5? Spotting the pattern is the real puzzle.

How to use Tower of Hanoi

  1. Tap a peg to pick up its top disk, then tap another peg to drop it.
  2. A disk can only go on an empty peg or a bigger disk.
  3. Move the whole tower to the right peg. Try to match the minimum number of moves.

Teaching ideas

  • Record the fewest moves for 1, 2, 3 and 4 disks and look for the pattern (1, 3, 7, 15...).

Frequently asked questions

What is the minimum number of moves?

For n disks it is 2ⁿ − 1, so 3 disks take 7 moves, 4 disks take 15 and 5 disks take 31.

You might also like