Iteration strikes back - at the cyclic Towers of Hanoi

DOI10.1016/0020-0190(83)90032-7zbMath0508.68020OpenAlexW1993080738MaRDI QIDQ1838033

Timothy R. S. Walsh

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90032-7

zbMATH Keywords

iterative solutionTowers of Hanoicyclic motionrecusion vs. iteration

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (9)

Derivation of efficient programs for computing sequences of actions ⋮ The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ An iterative algorithm for the cyclic Towers of Hanoi problem ⋮ A statistical analysis of the towers of hanoi problem ⋮ An optimal algorithm to implement the Hanoi towers with parallel moves ⋮ Parallelism for multipeg towers of Hanoi ⋮ Recursive information transducers: Computation models ⋮ A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle ⋮ Towers of Hanoi problems: deriving iterative solutions by program transformations

Cites Work

• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: Iteration strikes back - at the cyclic Towers of Hanoi