Towers of hanoi graphs

DOI10.1080/00207168608803502zbMath0656.05064MaRDI QIDQ3803164

Xuemiao Lu

Publication date: 1986

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

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

zbMATH Keywords

Hamiltonian cycle; minimal path; Hanoi Graph; Towers of Hanoid puzzle

Mathematics Subject Classification ID

05C99: Graph theory

Related Items

A tour of general Hanoi graphs, Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes, The number of moves of the largest disc in shortest paths on Hanoi graphs, On the planarity of Hanoi graphs, Shortest paths in Sierpiński graphs, Shortest paths between regular states of the Tower of Hanoi, The average distance on the Sierpiński gasket, A note on parallelism for the towers of Hanoi, Four encounters with Sierpiński's gasket, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, Parallelism for multipeg towers of Hanoi, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph, Enumeration of spanning trees on Apollonian networks, Tutte polynomial of the Apollonian network, The complexity of an optimal algorithm for the generalized tower of hanoi problem, Towers of hanoi problem with arbitraryk≧3 pages, A statistical analysis of the towers of hanoi problem, A loopless approach to the multipeg towers of hanoi

Cites Work

• The towers of Hanoi revisited: Moving the rings by counting the moves
• Adjudicating a towers of hanoi contest†
• Discussion and correspondence: A note on the Towers of Hanoi problem