另一种的规律的C语言描述的汉诺塔，利用了二进制的非零位来确定移动后的状态，避免了因为层数的巨大造成步数庞大，使计算缓慢、数据溢出、空间不足的缺陷。可得到移动的总步数，第几步的操作以及状态。当层数为1024时的数据是可观的，但反应速度并不慢。-Another law of the C language descr iption of the Tower of Hanoi, the use of the binary non-zero position to determine the state after the move to avoid the huge number of steps caused by the large number of steps, so that the calculation of slow, data overflow, defect. The total number of steps of the movement, the operation of the first step, and the state are obtained. When the number of layers is 1024 when the data is considerable, but the reaction speed is not slow.