A loopless approach to the multipeg towers of hanoi

DOI10.1080/00207169008803833zbMath0825.68414OpenAlexW2088088020MaRDI QIDQ4009743

Xuemiao Lu

Publication date: 27 September 1992

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach

Cites Work

• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• A generalization of the cyclic towers of hanoi: an iterative solution
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The multiway trees of hanoi^†
• Adjudicating a towers of hanoi contest†
• Towers of hanoi graphs
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: A loopless approach to the multipeg towers of hanoi