汉诺塔问题递归算法求解

#include<iostream>

void move(int n, char from, char to){
std::cout << "move the " << n << " from " << from << " to " << to << std::endl;
}

void Hanoi(int n, char from, char to, char by){
if (n >= 3){
Hanoi(n - 1, from, by, to);
move(n, from, to);
Hanoi(n - 1, by, to, from);<span id="transmark"></span>
}
else if (n == 1){
move(n, from, to);
}
else if (n == 2){
move(n - 1, from, by);
move(n, from, to);
move(n - 1, by, to);
}
}

int main(void){
int n = 5;	//n为汉诺塔的层数
Hanoi(n, 'A', 'C', 'B');
return 0;
}