HANOI TOWERS
24 towers. Move the stack to the marked post, one disc at a time, and never put a bigger disc on a smaller one. Par is the proven shortest solution.
24 towers
3 → 8 discs
par = 2^n − 1
TOWER 1
TOWER REBUILT
★★★
0
NEXT TOWER
OUT OF MOVES
TRY AGAIN
BACK TO TOWER 1
ALL 24 REBUILT
0
Every stack moved across.
PLAY AGAIN