奇偶型Hanoi塔问题研究

The odd-even tower of Hanoi with forbidden moves

讨论了一种奇偶型Hanoi塔问题及其4种具有禁止移动约束的模型,给出了每种禁止条件下的递归算法,并计算了最小移动次数的控制项.

An odd-even tower of Hanoi problem and its four models with forbidden moves are considered in this paper, which is a generalization of the traditional one. The optimal recursive algorithms for these new models are provided, and the dominant terms of the number of moves for each case are found.