汉诺塔: 递归算法

汉诺塔，参加百度百科https://baike.baidu.com/item/%E6%B1%89%E8%AF%BA%E5%A1%94/3468295
代码如下：

        static void Main(string[] args)
        {
            char A = 'A';
            char B = 'B';
            char C = 'C';
            hanoi(4, A, B, C);
        }
        static int m = 0;

        public static void move(int disks,char N,char M)
        {
            Console.WriteLine("第"+(++m)+"次移动："+"把"+disks+"号圆盘从"+N+"移到"+M);
        }
        
        public static void hanoi(int n,char A,char B,char C)
        {
            if (n == 1)
                move(1, A, C);
            else
            {
                hanoi(n - 1, A, C, B);
                move(n, A, C);
                hanoi(n - 1, B, A, C);
            }
        }