An iterative algorithm for the cyclic Towers of Hanoi problem

DOI10.1007/BF00978713MaRDI QIDQ3219130zbMATH OpenFDO

Authors M. C. Er

Publication date 1984

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

Full work available at URL https://doi.org/10.1007/BF00978713

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• A generalization of the cyclic towers of hanoi: an iterative solution
• The Colour Towers of Hanoi – An Iterative Solution
• An iterative optimal algorithm for the generalized tower of hanoi problem
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• Towers of Hanoi problems: deriving iterative solutions by program transformations

Cites work

• 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
• Eliminating recursion from combinatoric procedures
• Iteration strikes back - at the cyclic Towers of Hanoi
• The cyclic towers of Hanoi
• The Towers of Hanoi Problem

Cited in

(16)

• Towers of Hanoi problems: deriving iterative solutions by program transformations
• Derivation of efficient programs for computing sequences of actions
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
• An iterative algorithm for the Tower of Hanoi with four pegs
• Note on the cyclic towers of Hanoi
• Computational solution of an old tower of Hanoi problem
• A generalization of the cyclic towers of hanoi: an iterative solution
• The Colour Towers of Hanoi – An Iterative Solution
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• An iterative optimal algorithm for the generalized tower of hanoi problem
• Pour en finir avec la dérécursivation du problème des tours de Hanoï
• The complexity of the generalised cyclic Towers of Hanoi problem
• The Towers of Hanoi and Binary Numerals
• The Cyclic Towers of Hanoi and Pseudo Ternary Codes
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219130)