Math · Mathematical proceduresVISUAL DISCOVERY 388 OF 1,100
Hanoi Moves
Explorer · about 8 minutes · a little curiosity goes a long way
Browse all adventures
For grown-ups
Today’s little discovery
Moving n Hanoi disks needs two transfers of n−1 disks and one move of the largest disk. The recurrence yields 2ⁿ−1 minimum moves.
Ask your learner to point to the part that supports their answer about hanoi moves. For steps, powers, explain unfamiliar ideas together before using the model.
This is a learning model. Try the take-home activity together.Voice settings
Using Heart (en-US).
Saved voices download ahead of play for this activity. No lesson text is sent to a speech service.The sample plays once and does not change the Sound on/off setting.- Wonder
- Guess
- Try it
- Discover
- Celebrate
HERE’S A LITTLE WONDER…
What does hanoi moves reveal about hanoi minimum moves?
A precise sequence of operations transforms a starting mathematical object. Moving n Hanoi disks needs two transfers of n−1 disks and one move of the largest disk.
No rush. Try an idea and see.Open Lesson to read the question, choose your idea, and continue.