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. Discret. Math.},
  • D. Romik
  • Published 8 October 2003
  • Computer Science
  • SIAM J. Discret. Math.
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, $\frac{63}{38} \approx 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… 

Figures from this paper

An efficient algorithm to determine all shortest paths in Sierpiński graphs

Algorithms and Bounds for Tower of Hanoi Problems on Graphs

This thesis studies a generalization of the classic Tower of Hanoi puzzle, considering graphs which are composed of ` SCCs, each one isomorphic to K3, and concentrate on the logarithm of time(H), looking for asymptotic vii.

The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by the ascertained results that may shed some light on the notoriously open FSC.

Distances and automatic sequences in distinguished variants of Hanoi graphs

In this thesis three open problems concerning Hanoi-type graphs are addressed. I prove a theorem to determine all shortest paths between two arbitrary vertices s and t in the General Sierpinski

On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem

This paper settles the conjecture of Dinitz and Solomon from SOFSEM'07 in the affirmative, and shows that the average- case complexity of the BTH problem is asymptotically the same as the worst-case complexity, for all n and k.

Shortest paths in Sierpiński graphs

Twin Towers of Hanoi

  • Z. Sunic
  • Computer Science
    Eur. J. Comb.
  • 2012

Independent sets on the Towers of Hanoi graphs

The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity in the Tower of Hanoi graph H n at stage n, and recursion relations for the numbers are derived.



An analysis of the generalized Towers of Hanoi problem

  • M. Er
  • Computer Science
  • 1983
The shortest-path tree clearly characterizes the generalized Towers of Hanoi problem; and its use leads to a very simple analysis of the generalized problem.

Shortest paths between regular states of the Tower of Hanoi

  • A. Hinz
  • Computer Science
    Inf. Sci.
  • 1992

Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

For any n ≥ 1 and any k ≥ 1, a graph S(n, k) is introduced. Vertices of S(n, k) are n-tuples over {1, 2,. . . k} and two n-tuples are adjacent if they are in a certain relation. These graphs are

A statistical analysis of the towers of hanoi problem

The Towers of Hanoi problem is analyzed with the aid of Hanoi graphs depicting legal configurations (i. e. arrangements of the disks on the pegs) and the transitions among them. Specifically, the

The average distance on the Sierpiński gasket

SummaryThe canonical distance of points on the Sierpiński gasket is considered and its expectation deduced. The solution is surprising, both for the value and for the method derived from an analysis

Pour la science

Email: romik@stat.berkeley

  • Email: romik@stat.berkeley

Self-similar sets VIII

  • Average interior distance in some fractals. Measure theory (Oberwolfach, 1990). Rend. Circ. Mat. Palermo (2) Suppl. No. 28
  • 1992