#include<stdio.h>
/*
**汉诺塔问题:将N个盘子从one座借助two座到达three座
*/
void main()
{
void hanoi(int n,char one,char two,char three);
int m;
printf("enter the number that you want to move:\n");
scanf("%d ",&m);
hanoi(m,'A','B','C');
}
void hanoi(int n,char one,char two,char three)
{
void move(char x,char y);
if(n==1)
{
move(one,three);
}else
{
hanoi(n-1,one,three,two); //这是递归的核心
move(one,three);
hanoi(n-1,two,one,three);
}
}
void move(char x,char y)
{
printf("%c -->%c\n",x,y);
}