Tower of Hanoi Puzzle

Move all disks from the first tower to the last tower following the rules. Try to solve it in the minimum number of moves!

Puzzle Board
Moves: 0

Game Controls

Minimum moves required: 7
Optimal (min moves)
Good (up to 1.5x)
Poor (more than 1.5x)

How to Play

The Tower of Hanoi is a mathematical puzzle where you must move all disks from the first tower to the last tower, following these rules:

  • Only one disk can be moved at a time.
  • Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.
  • No disk may be placed on top of a smaller disk.

To move a disk: Click on a tower to select it, then click on another tower to move the top disk.

Or drag and drop: Drag a disk from one tower and drop it onto another tower.

Game Stats

0
Moves
3
Disks
0%
Efficiency

Game Rules

  • Start with all disks on Tower A
  • Goal: Move all disks to Tower C
  • You can use Tower B as intermediate
  • Larger disks cannot be on top of smaller ones

Move History

Congratulations!

You solved the Tower of Hanoi puzzle!

Disks: 3 | Moves: 7 | Minimum: 7 | Efficiency: 100%