Related papers: On generalized Frame-Stewart numbers
We derive a unified closed-form expression for the Frame-Stewart algorithm in the multi-peg Tower of Hanoi: M(p,n) = 2^(i(p,n)+1)*n - sum_{k=0}^{i(p,n)} 2^k * C(p+k-2, k), where i(p,n) = min{ j >= 0 : n <= C(p-1+j, j+1) }. and prove it…
In this paper, our aim is to prove that our recursive algorithm to solve the "Reve's puzzle" (four- peg Tower of Hanoi) is the optimal solution according to minimum number of moves. Here we used Frame's five step algorithm to solve the…
Considering the symmetries and self similarity properties of the corresponding labeled graphs, it is shown that the minimal number of moves in the Tower of Hanoi game with $p =4$ pegs and $n \geq p$ disks satisfies the recursive formula $…
The Frame-Stewart conjecture states the least number of moves to solve a generalized Tower of Hanoi problem, of n disks and p pegs. In this paper, we prove a weaker version of the Frame-Stewart conjecture.
The purpose of this paper is to prove the Frame-Stewart algorithm for the generalized Towers of Hanoi problem as well as finding the number of moves required to solve the problem and studying the multitude of optimal solutions. The main…
The Tower of Hanoi continues to provide a surprisingly rich meeting point for recursive reasoning, combinatorial geometry, and computational verification. Motivated by the editorial standards of the Bulletin of the Australian Mathematical…
We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.
The Frame-Stewart algorithm for the 4-peg variant of the Tower of Hanoi, introduced in 1941, partitions disks into intermediate towers before moving the remaining disks to their destination. Algorithms that partition the disks have not been…
In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between…
In the Tower of Hanoi problem, there is six types of moves between the three pegs. The main purpose of the present paper is to find out the number of each of these six elementary moves in the optimal sequence of moves. We present a…
The generalized Tower of Hanoi problem with h \ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Path_h variant, where…
More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry Bousch in a breakthrough paper in 2014. The general problem with p pegs is still open, with the best lower bound on the minimum number of…
We introduce and study a new four-peg variant of the Tower of Hanoi problem under parity constraints. Two pegs are neutral and allow arbitrary disc placements, while the remaining two pegs are restricted to discs of a prescribed parity: one…
The weighted Tower of Hanoi is a new generalization of the classical Tower of Hanoi problem, where a move of a disc between two pegs $i$ and $j$ is weighted by a positive real $w_{ij}\geq 0$. This new problem generalizes the concept of…
I prove that the group of symmetries of the Tower of Hanoi graph with k pegs and n disks, denoted H_n^k, is isomorphic to the group of permutations of k elements, S_k, for all k greater than or equal to 3 and positive n.
The problem of the Hanoi Tower is a classic exercise in recursive programming: the solution has a simple recursive definition, and its complexity and the matching lower bound are the solution of a simple recursive function (the solution is…
We prove the exact formulae for the expected number of moves to solve several variants of the Tower of Hanoi puzzle with 3 pegs and n disks, when each move is chosen uniformly randomly from the set of all valid moves. We further present an…
Consider the restricted Hanoi graphs which correspond to the variants of the famous Tower of Hanoi problem with multiple pegs where moves of the discs are restricted throughout the arcs of a movement digraph whose vertices represent the…
The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in recommendation systems, where instead of k best objects the k…
A simple graph $G$ is an {\it 2-tree} if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is an 2-tree. Clearly, if $G$ is an 2-tree on $n$ vertices, then $|E(G)|=2n-3$. A non-increasing sequence…