C语言 hanoi塔用递归函数求解问题，怎么去理解？能不能解释一下？！小白求教

Question

#include
void hanoi(unsigned int n,char fr,char te,char to);
void moveplate(unsigned int n,char fr,char to);
int main()
{
unsigned int n;
scanf("%u",&n);
hanoi(n,'A','B','C');
return 0;
}
void hanoi(unsigned int n,char fr,char te,char to)
{
if(n==1)
moveplate(n,fr,to);
else
{
hanoi(n-1,fr,to,te);
moveplate(n,fr,to);
hanoi(n-1,te,fr,to);
}
}
void moveplate(unsigned int n,char fr,char to)
{
printf("%u:%c %c\n",n,fr,to);
}

Answer 1

http://blog.sina.com.cn/s/blog_648e17bf0101ahbt.html