The weighted Tower of Hanoi

Abstract

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}\ge 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.

10 pages, 3 figures

Cited by in corpus (2)

• On the restricted Hanoi Graphs
• The Towers of Fibonacci, Lucas, Pell, and Jacobsthal