四柱汉诺塔非递归研究与实现

Research on non-recursive algorithm of 4-peg hanoi tower

对"经典三柱汉诺塔"的递归求解算法及其他非递归算法问题进行了详细的分析和研究,给出了一种新的简单且高效的非递归算法。在"经典三柱汉诺塔"的非递归算法研究基础上对"四柱汉诺塔"问题的四柱汉诺塔Frame算法进行了深入的研究,实现了一种高效的四柱汉诺塔非递归算法,并用C#语言进行了验证。通过该问题的C#实现,可使学习者清晰地观测到解决四柱汉诺塔非递归算法的全过程。

Detailed analysis about hanoi issue is carried out and one easy and efficient realization of non-recursive aIgorithra in program C# is given. Frame algorithm of 4-peg hanoi tower is analyzed and researched based on the classic 3-peg hanoi tower program and a non-recursive and efficient algorithm of 4-peg hanoi tower is proposed. Realization of 4-peg hanoi tower algorithm though program C# can make learners observe clearly the whole process which solves this issue.