总个数确定后，每张盘curDisk的移动方向maybe_To是确定的且唯一的：如共有三个盘时，盘1始终向左移动。 这里，将柱子由左向右看成A(源柱子Source),B(借助的柱子Borrow),C(目标柱子Target). A的左看成C，B的左看成A，C的左看成B； A的有看成B，B的右看成C，C的右看成A； 每张盘的移动方法(因为不可能连续两次移动相同的盘！)： 一个盘curDisk现在在 柱子curStick上，那么curDisk另一个柱子(3个中除了2个的另1个) 只要有选择的选择一个柱子curStick,分析、判断其最上面的盘curDisk的能否向curDisk确定的唯一的方向移动；移动 完后 再 选择 另一个 柱子 分析 判断 就可以完成了 (这个算法特别适合于人玩这个“弱智”（我有同学这么说）游戏，我玩我的文曲星pc1000a上的Hanoi 9层游戏，需要5分钟就可以移动完毕)-total number identified, each set curDisk maybe_To direction of the movement of which is determined only : If there are three disk, was always left a mobile. Here, the columns from left to right as A (source pole Source), B (using the pole Borrow), C (target pole Target). A left as C, B to the left as A, C on the left as B; A as the B, B on the right side as C, the right as A; each set of mobile methods (as it is impossible for the same two mobile disk!) : a set curDisk curStick now on the pole, then curDisk another pole (three in addition to two other one), when given a choice, choose a pole curStick, analysis, judgment, the most above-curDisk curDisk the ability to determine the direction of the only mobile; mobile End choice after another pole analysis and judgment can be completed (thi