经典游戏汉诺塔的实现。本程序较短，采用递归算法-Implementation of classic game Tower of Hanoi. The procedure is shorter, using the recursive algorithm

The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower,[1] and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts wit

acm超级经典的算法。内容包括河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官（一） 老鼠走迷官（二） 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题（Knapsack Problem） 数、运算 蒙地卡罗法求 PI 等等。-acm super classic algorithms. Including Hanoi Tower Fei-style Liebasika tri