A generalization of the cyclic towers of hanoi: an iterative solution

DOI10.1080/00207168408803406zbMATH Open0535.68032OpenAlexW2094787256MaRDI QIDQ3319783FDOQ3319783

Authors: M. C. Er 

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803406

Recommendations

• An iterative algorithm for the cyclic Towers of Hanoi problem
• An iterative optimal algorithm for the generalized tower of hanoi problem
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The Generalized Towers of Hanoi Problem
• The Colour Towers of Hanoi – An Iterative Solution

zbMATH Keywords

iterative solutioncyclic Towers of Hanoi

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites Work

• Title not available (Why is that?)
• The cyclic towers of Hanoi
• The Towers of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem

Cited In (12)

• An iterative algorithm for the Tower of Hanoi with four pegs
• Towers of hanoi problem with arbitraryk≧3 pages
• A loopless approach to the multipeg towers of hanoi
• An iterative algorithm for the cyclic Towers of Hanoi problem
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The Colour Towers of Hanoi – An Iterative Solution
• Exponential vs. Subexponential Tower of Hanoi Variants
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
• Towers of Hanoi problems: deriving iterative solutions by program transformations
• Note on the cyclic towers of Hanoi
• The complexity of the generalised cyclic Towers of Hanoi problem

This page was built for publication: A generalization of the cyclic towers of hanoi: an iterative solution

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