论文标题
在河内塔的最佳解决方案中枚举移动
Enumerating moves in the optimal solution of the Tower of Hanoi
论文作者
论文摘要
在河内问题的塔中，这三个钉子之间有六种类型的移动。本文的主要目的是在最佳移动序列中找出这六个基本移动中的每一个的数量。我们基于指标函数提出了递归函数，该功能计算每个基本移动的数量，我们研究了其一些属性，包括组合身份，递归公式和生成功能。我们还发现和有趣的序列与计算这些基本动作的每种类型密切相关，这些序列也将确定其属性。
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.
