HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Python Labs
  2. /The Tower of Hanoi, move by move
MathematicsMediumHigh School (11–12)Mathematical Induction

The Tower of Hanoi, move by move

You will write the recursive solution of the Tower of Hanoi, list its moves, and check them against the rules.

The idea. To move nnn discs from peg a to peg c with spare peg b: move n−1n - 1n−1 discs from a to b, move the largest disc from a to c, then move the n−1n - 1n−1 discs from b to c. Induction shows this takes 2n−12^n - 12n−1 moves.

Your tasks.

  1. Finish moves(n, a, b, c). Return the list of moves, each a pair (from_peg, to_peg), that carries nnn discs from a to c.
  2. Finish count(n). Return the number of moves by the recursion H(n)=2H(n−1)+1H(n) = 2H(n - 1) + 1H(n)=2H(n−1)+1, with H(0)=0H(0) = 0H(0)=0.
  3. Finish legal(n, move_list). Play the moves on three pegs and return True if no disc is ever put on a smaller one and all discs end on peg "C".

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, print moves(3, "A", "B", "C") and follow the seven moves with three coins of different sizes.

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Matrix powers against a formulaDivision without the division keys →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. Matrix powers against a formulaMedium
  2. Fibonacci identities by computerMedium
  3. Where an inequality starts to holdMedium
  4. Divisibility, value by valueMedium
  5. Test a formula, then find where a pattern breaksMedium
All labs on this topic →