The Tower of Hanoi is a classic mathematical puzzle invented in 1883. Move all disks from peg A to peg C, one at a time, never placing a larger disk on a smaller one.
Minimum moves for 5 disks: 31. Can you do it?
Also try: Sliding Puzzle.