Towers of hanoi problem with arbitraryk≧3 pages

DOI10.1080/00207168808803630zbMath0658.68090OpenAlexW2060109034MaRDI QIDQ3806843

Xuemiao Lu

Publication date: 1988

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

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

zbMATH Keywords

recursive algorithmTowers of Hanoi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ On uniqueness of solution to the multi-peg towers of hanoi ⋮ Parallelism for multipeg towers of Hanoi

Cites Work

• 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
• 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: Towers of hanoi problem with arbitraryk≧3 pages