• Corpus ID: 18183339

Explorations in 4-peg Tower of Hanoi Ben

  title={Explorations in 4-peg Tower of Hanoi Ben},
  author={Ben Houston and Hassan Masum},
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D representations of the state transition graphs. Finally, two variants (k-out-of-order and k-at-a-time) and… 

Figures and Tables from this paper

Bounded Hanoi

The space complexity of the Tower of Hanoi puzzle, i.e., how many disks need to be accommodated on the pegs involved in the transfer, is considered for the first time.

What is the least number of moves needed to solve the 4-peg Towers of Hanoi problem?

  • R. Demontis
  • Mathematics, Computer Science
    Discret. Math. Algorithms Appl.
  • 2019
It is proved that the solutions to the Tower of Hanoi problem given by Frame and Stewart are minimal and the maximum number of disks that can be moved using formula is [Formula: see text].



On the Frame--Stewart Conjecture about the Towers of Hanoi

It is proved that FS(n,k) and H(n-k) both have the same order of magnitude of $2^{(1\pm o(1)!)(n(k-2)!)^{1/(k- 2)}}$.

Variations on the Four-Post Tower of Hanoi Puzzle

The famous Tower of Hanoi puzzle, invented in 1883 by Edouard Lucas (see [21]), consists of three posts and a set of n, typically 8, pierced disks of differing diameters that can be stacked on the

In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?

In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k-2) lower bound on the number of steps

Simple Explicit Formulas for the Frame-Stewart Numbers

Abstract. Several different approaches to the multi-peg Tower of Hanoi problem are equivalent. One of them is Stewart's recursive formula ¶¶$ S (n, p) = min \{2S (n_1, p) + S (n-n_1, p-1)\mid n_1,

On the planarity of Hanoi graphs

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

Square-edge graphs, partial cubes and their subclasses

  • 1998

pdf. S. Klavzar. Square-edge graphs, partial cubes and their subclasses

  • pdf. S. Klavzar. Square-edge graphs, partial cubes and their subclasses
  • 1998

Results and open problems on the Tower of Hanoi

  • In Congressus Numerantium, Volume
  • 1999

Results and open problems on the Tower of Hanoi

  • Congressus Numerantium
  • 1999