The Cyclic Towers of Hanoi: A Representation Approach

DOI10.1093/comjnl/27.2.171zbMath0529.68040OpenAlexW2052561703MaRDI QIDQ3311679

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.2.171

zbMATH Keywords

iterative solutioncyclic Towers of Hanoi problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items

The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ The worst parallel Hanoi graphs ⋮ The worst Hanoi graphs ⋮ A tour of general Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ A statistical analysis of the towers of hanoi problem

This page was built for publication: The Cyclic Towers of Hanoi: A Representation Approach