Tower of Hanoi

About this game

Classic recursive puzzle. Move disks between rods with minimal moves.

How to play

How do you play Tower of Hanoi?

Move one disk at a time. A disk can only be placed on a larger disk or empty rod. Move all disks from the left rod to the right rod with minimal moves.

What is the optimal number of moves?

For n disks on 3 rods, the optimal is 2^n - 1 moves. For 4 rods, it's fewer (Frame-Stewart algorithm).