汉洛塔问题

hanoi.cpp

/***
 *
 * 汉诺塔问题
 *                |-- n=1  move(A,C)
 * hanoi(n,A,B,C)-|-- n>1  hanoi(n-1,A,C,B)
 *                |        move(A,C)
 *                         hanoi(n-1,B,A,C)
 */
# include<stdlib.h>
# include<stdio.h>
# include<conio.h>

char move(char x,char y);
void hanoi(int n,char A,char B,char C);

int main()
{
    int n;
    scanf("%d",&n); //输入塔盘的个数
    printf("移动%d个盘子的步骤是\n",n);
    hanoi(n,'A','B','C');
    return 0;
}

void hanoi(int n,char A,char B,char C){
    //解体步骤(参考文件头部)
    //递归调用
    if (n == 1) move('A','C');
    else{
        hanoi(n-1,'A','C','B');
        move('A','C');
        hanoi(n-1,'B','A','C');
    }
}

char move(char x,char y)
{
    printf("%c  ------------->  %c\n",x,y);
}