关键词: 汉诺塔, 非递归算法, 抽象解树, 层次迭代

Abstract: The tower of Hanoi puzzle is a classic example about programming design and algorithm research.There have been a lot of researches on this algorithm.In order to speed up the tower of Hanoi problem solving this paper analyzes the abstract solving-tree of the tower of Hanoi problem and find it can be divided into different levels and the same structure，and then iterated the solution of the whole problem by controlling the levels of subtree.Based on this，a rapid non-recursive algorithm of the tower of Hanoi problem through different levels iteration of known subtree is proposed.The result of running time show that this algorithm speed up the velocity of the solving problem.

Key words: tower of Hanoi, non-recursive algorithm, abstract solution-tree, level iteration