Move the whole tower from peg A to peg C. You can only move one disk at a time, and never place a larger disk on a smaller one. Minimum moves for n disks: 2n−1.
Move the tower with one-disk moves and no larger-on-smaller.
3 to 6 disks — from a warm-up to a real brain workout.
Watch the optimal recursive solution animate step by step.
Compare your move count against the mathematical minimum.
Try Sudoku, 2048, Word Chain and more from the Fun & Games collection.
Play Sudoku