Hanoi塔演示动画在Flash中的实现

Realization of Moving Hanoi Tower in Flash

Hanoi塔是程序设计中比较经典的递归问题.递归算法一直为大家所熟识,但真正用直观的方法将其演示出来却较少被提及.本文就Hanoi塔递归算法在Flash中的实际应用进行探讨,模拟:Hanoi塔的具体移动过程.

Hanoi Tower is more classical recursion problem while designing program. All the time, the recursion algorithm of Hanoi Tower is known well by everybody, but the ocular demonstration of it is less mentioned. This text carries on the discussion on the practical application of recursion algorithm of Hanoi Tower in Flash, and tries to imitate the concrete course of moving Hanoi Tower.