说明：   该程序是经典的Hanoi塔问题的Java语言版，演示了把左边杆子中的所有大小不同的碟子移动到右边的杆子上的步骤，每次只能移动一个碟子，而且碟子只能放在比它大的碟子上。选择 AutoSolve，就可以自动让计算机为你解决该难题了。速度滚动条决定了程序运行的速度。
(The program is the Java language version of the classic Towers of Hanoi problem, demonstrates the steps to the left pole in all different sizes of dish move to the right pole, you can only move one dish, and dishes can be placed only than it a large plate. Select AutoSolve can automatically get the computer to solve the problem for you. The speed of the scroll bar determines the speed of the program is running.)