Hacène Belbachir

El-Mehdi Mehiri, Saad Mneimneh, Hacène Belbachir

We present in this paper four new variants of the Tower of Hanoi problem, the optimal solution of each of these variants is related to one of the four known numbers Fibonacci, Lucas, Pell, and Jacobsthal. We give an optimal solution to each of these variants, and we present their associated graphs.

Hacène Belbachir, El-Mehdi Mehiri

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 recursive function based on indicator functions, which counts the number of each elementary move, we investigate some of its properties including combinatorial identities, recursive formulas and generating functions. Also we found and interesting sequence that is strongly related to counting each type of these elementary moves that we'll establish some if its properties as well.

El-Mehdi Mehiri, Hacène Belbachir

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 finding the minimum number of moves to solve the Tower of Hanoi, to find a sequence of moves with the minimum total cost. We present an optimal dynamic algorithm to solve the weighted Tower of Hanoi problem, we also establish some properties of this problem, as well as its relation with the Tower of Hanoi variants that are based on move restriction.