What is the minimum number of moves?

For n disks the minimum is exactly 2^n - 1 moves: 3 disks = 7 moves, 4 disks = 15, 5 disks = 31, 6 disks = 63, 7 disks = 127. PlayMemorize gives you a small budget above this minimum so beginners can still win while learning the pattern.

How do I always find the optimal solution?

The recursive trick: to move n disks from A to C using B, first move n-1 disks from A to B, then move disk n from A to C, then move n-1 disks from B to C. Repeat this rule at every step and you will always reach the minimum move count.

What happens if I run out of moves?

The round ends and is counted as a loss. You get to try again with a fresh puzzle. In the labyrinth, exhausting the move budget drops you back one level.

Can I print Tower of Hanoi as a worksheet?

Yes. The worksheet version shows a sequence of peg-state diagrams and asks students to fill in the correct next move. Build a sheet from the master generator at /worksheets.

Does it work offline?

Yes. PlayMemorize is a Progressive Web App. Install once and Tower of Hanoi plays anywhere without an internet connection.

Tower of Hanoi · Čeština

Klasika · přesuň celou věž disků na jiný kolík, jeden disk po druhém, nikdy větší na menší

Klasická hádanka Věž v Hanoji · přesuňte všechny disky z první kolíky na třetí, nikdy neumisťujte větší disk na menší. Vyžaduje JavaScript.

Enable JavaScript to play.