An iterative algorithm for the cyclic Towers of Hanoi problem

DOI10.1007/BF00978713zbMath0555.68041MaRDI QIDQ3219130

M. C. Er

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Derivation of efficient programs for computing sequences of actions ⋮ The Cyclic Towers of Hanoi and Pseudo Ternary Codes

Cites Work

• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• Iteration strikes back - at the cyclic Towers of Hanoi
• Eliminating recursion from combinatoric procedures
• A Representation Approach to the Tower of Hanoi Problem
• Converting a class of recursive procedures into non-recursive ones
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: An iterative algorithm for the cyclic Towers of Hanoi problem