Shortest paths between regular states of the Tower of Hanoi

DOI10.1016/0020-0255(92)90067-IzbMath0792.68125MaRDI QIDQ1193833

Andreas M. Hinz

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

Tower of Hanoi

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R05: Combinatorics in computer science

05C99: Graph theory

Related Items

Distance-Uniform Graphs with Large Diameter, Random walks on dual Sierpinski gaskets, An efficient algorithm to determine all shortest paths in Sierpiński graphs, A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles, Shortest paths in Sierpiński graphs, Four encounters with Sierpiński's gasket, On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, Two-player tower of Hanoi, Distances in Sierpiński graphs and on the Sierpiński gasket, Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The super towers of Hanoi problem: Large rings on small rings
• An iterative solution to the generalized Towers of Hanoi problem
• A problem-decomposition method using differences or equivalence relations between states
• Towers of Hanoi problems: deriving iterative solutions by program transformations
• A general algorithm for finding a shortest path between two n- configurations
• An optimal algorithm for Reve's puzzle
• An iterative algorithm for the Tower of Hanoi with four pegs
• The average distance on the Sierpiński gasket
• The tower of Hanoi
• Adjudicating a towers of hanoi contest†
• Towers of hanoi graphs
• Counter examples to adjudicating a towers of hanoi contest
• A statistical analysis of the towers of hanoi problem
• Mechanical Discovery of Classes of Problem-Solving Strategies
• Programs for machine learning. Part II