The complexity of the generalised cyclic Towers of Hanoi problem

DOI10.1016/0196-6774(85)90004-5zbMath0576.68036OpenAlexW2033677204MaRDI QIDQ3696520

M. C. Er

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90004-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

The diameter of Hanoi graphs ⋮ On a question of Leiss regarding the Hanoi Tower problem ⋮ Tours de Hanoï et automates ⋮ A tour of general Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

This page was built for publication: The complexity of the generalised cyclic Towers of Hanoi problem