The Sage · Quest for The Tower of Hanoi
The Recursion Made Plain
The Prompt
Explain the recursive solution to the Tower of Hanoi to someone learning to program. Derive the closed form 2ⁿ − 1 from the recursion. Cite Lucas’s 1883 original presentation.
Completion Criteria
A short written explanation suitable for a beginner, a derivation of the closed form, and the citation.
Claim this quest
Students who have attested
No Students have attested this quest yet. Be the first.