Tower of Hanoi

Move all disks to the right peg. Larger disks can't go on smaller. Optimal solves in 2^n minus 1 moves.