What is the Tower of Hanoi?
The Tower of Hanoi is a timeless puzzle that hides a beautiful pattern, which is why it shows up everywhere from toy shops to computer science classes.
The rules
In Tower of Hanoi, you start with discs stacked biggest to smallest on one peg. You move one disc at a time to another peg, and a bigger disc can never sit on a smaller one. The goal is to rebuild the full stack on a different peg.
Where it comes from
French mathematician Edouard Lucas presented the puzzle in 1883, wrapping it in a legend about monks moving 64 golden discs. That story gave it mystery, but the real charm is the tidy pattern behind the solution, which our page on the minimum moves explains.
Why it teaches recursion
The clean trick is to move the top stack aside, move the biggest disc, then move the stack back on top. That same shape repeats at every size, which is why teachers love it as an example of recursion. It is also just a very satisfying logic puzzle to solve by hand.
Related questions
What is the minimum number of moves in Tower of Hanoi?
The minimum number of moves is 2 to the power of n, minus 1, where n is the number of discs. So three discs need 7 moves, four need 15, and ten need 1023. Each extra disc more than doubles the work, which is why big towers get so demanding.
What is a logic puzzle?
A logic puzzle is any challenge you solve by pure reasoning rather than luck or reflexes. You start with a set of rules and clues, then work out the one arrangement that fits every rule. Nonograms, Lights Out and Tower of Hanoi are classic examples.
Which puzzle is best for beginners?
For a gentle start, try the classic Slide Puzzle, Memory Match, or an easy Word Search. Their rules take seconds to learn and give quick, satisfying wins. Once you are comfortable, 2048 and nonograms add more depth without feeling overwhelming.