n个盘子,移动次数是pow(2,n)-1;f(n)=f(n-1)*2+1;
void hanoi(int n,char x,char y,char z)
{
if(n==1)
{
cout<<"move disk "<<n<<"from"<<x<<"to"<<z<<endl;
return;
}
hanoi(n-1,x,z,y);
cout<<"move disk "<<n<<"from"<<x<<"to"<<z<<endl;
hanoi(n-1,y,x,z);
}