论文标题
河内的加权塔
The weighted Tower of Hanoi
论文作者
论文摘要
河内的加权塔是对河内问题的新概括，其中两个钉子$ i $和$ j $之间的光盘的移动由正面的真实$ w_ {ij} \ geq 0 $加权。这个新问题概括了找到解决河内塔的最小移动次数的概念，以找到一系列移动，并以最低的总成本找到。我们提出了一种最佳的动态算法来解决河内问题的加权塔，我们还建立了此问题的某些特性，以及它与基于移动限制的河内变体塔的关系。
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.
