The Generalized Colour Towers of Hanoi: An Iterative Algorithm

DOI10.1093/COMJNL/27.3.278zbMATH Open0543.68059OpenAlexW2075215478MaRDI QIDQ3332268FDOQ3332268

Authors: M. C. Er 

Publication date: 1984

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/27.3.278

Recommendations

• The Colour Towers of Hanoi – An Iterative Solution
• An iterative optimal algorithm for the generalized tower of hanoi problem
• A generalization of the cyclic towers of hanoi: an iterative solution
• The Generalized Towers of Hanoi Problem
• An iterative algorithm for the cyclic Towers of Hanoi problem

zbMATH Keywords

iterative algorithmgeneralized colour Towers of Hanoi problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited In (13)

• The super towers of Hanoi problem: Large rings on small rings
• A loopless approach to the multipeg towers of hanoi
• An iterative algorithm for the cyclic Towers of Hanoi problem
• The Generalized Towers of Hanoi Problem
• An optimal algorithm for Reve's puzzle
• A generalization of the cyclic towers of hanoi: an iterative solution
• Counter examples to adjudicating a towers of hanoi contest
• The Colour Towers of Hanoi – An Iterative Solution
• Title not available (Why is that?)
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
• Parallelism for multipeg towers of Hanoi
• The Towers of Hanoi rainbow problem: Coloring the rings
• A statistical analysis of the towers of hanoi problem

This page was built for publication: The Generalized Colour Towers of Hanoi: An Iterative Algorithm

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