论文标题
河内塔变体的类似斐波那契的序列，以及相应的图和灰色代码
Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes
论文作者
论文摘要
我们以一种非常自然的方式修改了河内难题的经典塔规则，以使斐波那契序列涉及最佳分辨率算法，并显示出这种变体的一些不错的特性。特别是，我们从河内 - 菲比诺奇塔中得出了一个类似灰色的代码，这是一组二进制单词，而没有因子11，它具有某些特性，并从中获得了河内菲比诺基塔的迭代算法。这样的算法涉及斐波那契替代。最终，我们将研究简要地扩展到了一些自然概括。
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice properties of such a variant. In particular, we deduce from this Tower of Hanoi-Fibonacci a Gray-like code on the set of binary words without the factor 11, which has some properties intersting for itself and from which an iterative algorithm for the Tower of Hanoi-Fibonacci is obtained. Such an algorithm involves the Fibonacci substitution. Eventually, we briefly extend the study to some natural generalizations.
