Recursive Logic · Optimisation

Towers of Hanoi

Move all disks to peg C. Optimal score requires the minimum possible moves: 2ⁿ − 1.

0Moves

—Optimal

—Efficiency

0Score

3 Discs
7 moves

4 Discs
15 moves

5 Discs
31 moves

6 Discs
63 moves

7 Discs
127 moves

A · Source B · Spare C · Target

Efficiency — aim for 100%

0%Optimal: 100%

Leaderboard (by efficiency × disc count)

No scores yet.