Hanoi塔问题的最佳解法

Best Algorithm for Tower of Hanoi

Hanoi塔游戏是欧洲中世纪的一种智力游戏 ,又是一古老的趣味数学问题 ,也是具有递归调用的所有程序设计语言教材中递归调用的典型例题 .本文给出了独立的非递归解并从理论上证明了用新算法移动 2 n-

Tower of Hanoi, an intelligence game played in the Mediaeval Europe, and it is an interestring mathematic problem, It is also a typical example of recurison call algorlithm in all the teaching materials for programming language which include recurison call algorithm. This essay in the first time, proposes independent nonrecurison call algorithm, and has proved that using this new algorithm can solve the game by interchanging peutes 2 n-1 times.