递归调用求解汉诺塔问题。问题描述：有3根柱子A、B、C，A柱上有从小到大依次排列的若干个盘子（盘子数目由用户输入）。要求借助B柱把盘子全部搬到C柱上，每次只能搬动一个盘子，盘子必须始终保持从小到大的排放次序。要求结果显示出盘子移动过程。

-Tower of Hanoi problem solving recursive call. Problem Descr iption: There are three columns A, B, C, A pillar with small to large order of the number of plates (plate number entered by the user). With the B-pillar requires all moved to C column the plate, you can only carry a plate, plate must always remain small to large emissions order. Requirement results show the process of moving plates.