汉诺塔问题

用递归思想解决汉诺塔问题
要思考如果要挪动第n个盘子到z上，需要n-1个盘子如何挪动

#include<iostream>
using namespace std;
int i=1;     //计数器Move函数中记录步数
void Move(int n, char x, char y)   //将第N个盘子从x柱挪到y柱
{cout << "step " << i << " : " << "move" << n << " from  " << x << " to " << y << endl;i++;
}
void hanio(int n, char x, char y, char z)  //将N个盘子从x经过y挪到z
{if (n == 0) return;else{hanio(n - 1, x, z, y);//将n-1个盘子从x经过z挪到yMove(n, x, z);hanio(n - 1, y, x, z);}
}
int main()
{int n;cin >> n;hanio(n, 'A', 'B', 'C');return 0;
}