Tower of Hanoi Move Count Quiz: Disks, Pegs and 2^n − 1
Three pegs, a stack of disks and a rule that a bigger disk can never sit on a smaller one, the Tower of Hanoi move count quiz explores a classic puzzle. Play 10 interactive questions on Édouard Lucas, 1883, the rules, the 2^n − 1 formula, three disks, eight disks, recursion, the 64-disk legend, how long it would take and its use in computer science.
Start Tower of Hanoi Move Count Quiz
🎯 Daily Trivia Challenge • 🧠 10 Questions • ⏱️ 150 Seconds
Inventor
Who invented the Tower of Hanoi puzzle?
Year
In which year was the puzzle introduced?
Rule
Which rule must players always follow?
Formula
What is the minimum number of moves for n disks?
Three
How many moves are needed to solve the puzzle with three disks?
Eight
How many moves are needed for eight disks?
Recur
Which problem-solving idea does the puzzle famously illustrate?
Legend
According to the puzzle's legend, how many golden disks must monks move?
Time
About how long would 64 disks take at one move per second?
CS
Where is the Tower of Hanoi commonly used today?
Your score
0/10
Scroll down to see the explanation for each question.
Explanations: answer key for all 10 questions
- Q1: Who invented the Tower of Hanoi puzzle?
Answer: Édouard Lucas
He was a French mathematician. He sold the puzzle under a playful pen name. He worked in Paris.
- Q2: In which year was the puzzle introduced?
Answer: 1883
It quickly became popular in Europe. It is still sold as a toy today. It was sold as a toy.
- Q3: Which rule must players always follow?
Answer: A larger disk may never go on a smaller one
Only one disk moves at a time. The whole stack must reach another peg. It is simple to learn.
- Q4: What is the minimum number of moves for n disks?
Answer: 2^n − 1
Each extra disk roughly doubles the moves. The pattern grows very fast. It shows exponential growth.
- Q5: How many moves are needed to solve the puzzle with three disks?
Answer: 7
The formula gives 2 cubed minus 1. Beginners usually start with three disks. It is a quick win.
- Q6: How many moves are needed for eight disks?
Answer: 255
That is 2 to the eighth power minus 1. The original toy had eight disks.
- Q7: Which problem-solving idea does the puzzle famously illustrate?
Answer: Recursion
To move n disks, move n minus 1 disks out of the way, move the largest, then move the rest back on top. The same idea repeats at every level.
- Q8: According to the puzzle's legend, how many golden disks must monks move?
Answer: 64
When they finish, the legend says, the world will end. Lucas invented this story to promote the puzzle.
- Q9: About how long would 64 disks take at one move per second?
Answer: About 585 billion years
That is far longer than the age of the universe. The world is safe for now.
- Q10: Where is the Tower of Hanoi commonly used today?
Answer: Teaching recursion in computer science
Programming students write short functions to solve it. It shows how simple rules create big problems.
A Puzzle That Doubles
The Tower of Hanoi was invented by French mathematician Édouard Lucas in 1883. Players move a stack of disks between three pegs, one at a time, never placing a larger disk on a smaller one. The minimum number of moves for n disks is 2^n − 1, so three disks need 7 moves and eight disks need 255.
The puzzle illustrates recursion. Lucas's legend of monks moving 64 golden disks would take about 585 billion years at one move per second. Computer science classes use it to teach recursion.
What This Quiz Teaches
Puzzle fans will enjoy these questions.
- Who invented it
- What the rules are
- How many moves are needed
- What legend surrounds it
- How it is used today
Did You Know?
- The puzzle is also called the Tower of Brahma.
- Versions with four pegs are much harder to analyze.
- The smallest disk moves every other turn in the best solution.
- Psychologists use the puzzle to study planning.
- Wooden versions are popular toys.
Related Quizzes
Ready for another round?
Jump to a random quiz from the archive.