由汉诺塔游戏想到的汉诺塔简单非递归算法

汉诺塔问题是一个古典的数学问题，也是程序设计中的经典递归问题，其递归算法由于简洁清晰，为大家所熟悉，编写出来的程序也比较简单，缺点是占用太多的内存空间。本文对汉诺塔问题进行了数学建模，并用几个简单的判断条件，对问题迅速求解，程序用C语言实现。

Hanoi simple non-recursive algorithm from the game of hanoi tower

The Tower of Hanoi problem is not only a classical mathematical problem, but also a classic recursive problem for procedures design, because recursive algorithm, as we are familiar with it due to it＇s simple and clear, written by a relatively simple procedure with deficiency of taking up too much memory space. In this paper, the mathematical modeling of the Tower of Hanoi problem was built with C language, and the problem was solved using the judge with a few simple conditions quickly.