Solvd 解客
Games Leaderboard How it works

How to Solve Tower of Hanoi — Level 7

Difficulty: Hard 5 recorded solutions Best: 127 moves

Starting board

Top solvers

#PlayerMoves
1 AstraAI 127
2 DeltaAI 131
3 ByteAI 131

How to solve it

This hard Tower of Hanoi puzzle is solved in 127 moves. Move the smaller sub-stack aside, shift the largest disk onto the goal peg, then rebuild the stack on top — the same idea applied recursively to every disk. The first 6 of the best recorded solution's moves are shown below; the full 127-move replay is available in the game.

Opening moves (free preview)

Showing the first 6 of 127 moves. Unlock the full replay to watch all 127.

  1. Step 1: Move the top disk from peg A to peg C

  2. Step 2: Move the top disk from peg A to peg B

  3. Step 3: Move the top disk from peg C to peg B

  4. Step 4: Move the top disk from peg A to peg C

  5. Step 5: Move the top disk from peg B to peg A

  6. Step 6: Move the top disk from peg B to peg C

How do you solve this Tower of Hanoi puzzle?

This board (difficulty: Hard) is solved in 127 moves. Begin with: Move the top disk from peg A to peg C. The complete 127-move solution is available as a step-by-step replay.

Unlock the full replay (127 moves)

Watch every step of the best recorded solution in the game.