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 towers3 → 8 discspar = 2^n − 1

TOWER REBUILT

★★★
0

OUT OF MOVES

ALL 24 REBUILT

0
Every stack moved across.