The Generalized Colour Towers of Hanoi: An Iterative Algorithm

DOI10.1093/comjnl/27.3.278zbMath0543.68059OpenAlexW2075215478MaRDI QIDQ3332268

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

zbMATH Keywords

iterative algorithmgeneralized colour Towers of Hanoi problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (7)

An optimal algorithm for Reve's puzzle ⋮ A loopless approach to the multipeg towers of hanoi ⋮ Counter examples to adjudicating a towers of hanoi contest ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ A statistical analysis of the towers of hanoi problem ⋮ The super towers of Hanoi problem: Large rings on small rings ⋮ Parallelism for multipeg towers of Hanoi

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