What is the minimum number of moves in Tower of Hanoi?
There is a neat formula that tells you exactly how many moves a perfect Tower of Hanoi solve takes, and the pattern behind it is genuinely elegant.
The formula
For a Tower of Hanoi with n discs, the fewest possible moves is 2 to the power of n minus 1. Three discs take 7 moves, four take 15, five take 31, and the count keeps roughly doubling. Hitting that exact number is the mark of a flawless solve.
Why it doubles
To move n discs you first move the top n minus 1 out of the way, move the biggest disc once, then move that stack back. That means each new disc slightly more than doubles the moves needed, which is why difficulty climbs so fast, as our page on the hardest puzzles notes.
Chasing the minimum
Because the game tracks your moves, beating it in exactly 2 to the power of n minus 1 is a satisfying goal. Aiming for the minimum instead of just any finish is a great way to sharpen your planning, in the spirit of our improvement tips.
Related questions
What is the Tower of Hanoi?
The Tower of Hanoi is a puzzle with three pegs and a stack of discs of different sizes. You move the whole stack from one peg to another, one disc at a time, and you may never place a larger disc on top of a smaller one. Edouard Lucas introduced it in 1883.
What is the hardest puzzle on Puzzle.now?
There is no single hardest puzzle, because each one tests a different skill. Large nonograms demand deep logic, a many-disc Tower of Hanoi needs long recursive planning, and a bigger Lights Out board can feel almost impossible without a method. Difficulty is personal.
How do you get better at puzzles?
Improve by practicing a little and often rather than cramming, and by learning each game's core method instead of relying on trial and error. Review the moments you got stuck, and mix different puzzle types to build broad skills. Small, steady practice beats rare marathons.