Skip to content
INFINITE SUM
← Paradoxes & riddles

1:49

The Tower of Hanoi

the puzzle that would take 585 billion years

There are 3 pegs and a stack of disks on one peg, largest at the bottom. Move the whole stack to another peg, moving 1 disk at a time and never putting a larger disk on a smaller one. With 3 disks, it takes at least 7 moves.

Source: A classic puzzle, retold by INFINITE SUM and fact-checked against our curated notes

Want another one?

Type the name of a paradox or riddle you've heard of, or browse the rest of the archive.