The Tower of Hanoi is a classic mathematical puzzle. Move the whole stack of discs to the far peg, one disc at a time, never placing a bigger disc on a smaller one.
How this mode works
Tap a peg to lift its top disc, then tap where it goes.
Three discs take seven moves. Six take sixty-three. There is no shorter way.
Tips to get better
With an odd number of discs, move the smallest disc to the far peg first; with an even number, to the middle peg.
The smallest disc moves every other turn, always in the same direction around the pegs.
Between moves of the smallest disc there is only ever one legal move — make it.
The fewest possible moves is 2ⁿ − 1: seven for three discs, sixty-three for six.
At a glance
Mini games
Tower of Hanoi
Moves
No limit
Can you lose?
No, it never ends
Questions and answers
What are the rules of the Tower of Hanoi?
Move one disc at a time from the top of a peg, and never put a bigger disc on a smaller one. Get the whole stack to the far peg.
What is the minimum number of moves?
2ⁿ − 1 for n discs: 7 for three, 15 for four, 63 for six.
Is there a trick?
Yes — move the smallest disc every second turn in a fixed direction, and make the only other legal move in between.