求教汉诺塔问题，怎么都想不通。

源代码
#include<stdio.h>
void main()
{
void hanoi(int n,char one,char two,char three);
int m;
printf("Input the number of diskes:");
scanf("%d",&m);
printf("The step to moving %d diskes:\n",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); }