Shortest Paths in the Tower of Hanoi Graph and Finite Automata

  title={Shortest Paths in the Tower of Hanoi Graph and Finite Automata},
  author={Dan Romik},
  journal={SIAM J. Discrete Math.},
Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element is a finite-state machine which decides, after examining on the average only a small number of the largest discs (asymptotically, 63 38 ≈ 1.66), whether the largest disc will be moved once or twice. This solves a problem raised by Andreas Hinz, and results in a better understanding of how the… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 13 references

Self-similar sets VIII

  • C. Bandt, T. Kuschel
  • Average interior distance in some fractals…
  • 1992
Highly Influential
4 Excerpts

The average distance on the Sierpiński gasket

  • A. Hinz, A. Schief
  • Probab. Th. and Rel. Fields 87, 129–138
  • 1990
Highly Influential
6 Excerpts

The Tower of Hanoi

  • A. Hinz
  • Algebras and Combinatorics (ICAC’97, Hong Kong…
  • 1999

Graphs S(n

  • S. Klavzar, U. Milutinovic
  • k) and a variant of the Tower of Hanoi problem…
  • 1997
2 Excerpts