经典汉诺塔:将盘子从a,借助b,移动到c
受限汉诺塔:将盘子从a,借助b,移动到c,但是每次只能移入到b或者从b移出。
#include <iostream>
using namespace std;
int num_hanoi = 0;
int num_limited_hanoi = 0;
//借助b,把盘子从a移动到c
void hanoi(int n, char a, char b, char c)
{
//if only one
if (n == 1)
{
num_hanoi++;
cout << a << "-->" << c << endl;
}
//if have n
else
{
//先将上面的n-1个,借助c,从a移动到b上
hanoi(n - 1, a, c, b);
//再把最下面的那个从a,借助b,移动到c
hanoi(1, a, b, c);
//再把b上面的借助a移动到c
hanoi(n - 1, b, a, c);
}
}
//受限汉诺塔,每次必须是从b拿进,或者从b拿出
void limited_hanoi(int n, char a, char b, char c)
{
//only one
if (n == 1)
{
if (a != b)
{
cout << a << "-->" << b << endl;
num_limited_hanoi++;
}
if (b != c)
{
cout << b << "-->" << c << endl;
num_limited_hanoi++;
}
}
else
{
//把上面的n-1个,从a,通过b,拿到c
limited_hanoi(n - 1, a, b, c);
//把下面的那一个从a拿到b
limited_hanoi(1, a, b, b);
//把c的n-1个,通过b,拿到a
limited_hanoi(n - 1, c, b, a);
//把b下面的那个拿到c
limited_hanoi(1, b, c, c);
//把a上面的通过b拿到c
limited_hanoi(n - 1, a, b, c);
}
}
int main()
{
int n;
cout << "Input the plate number:";
cin >> n;
cout << " hanoi:" << endl;
hanoi(n, 'a', 'b', 'c');
cout << " limited_hanoi:" << endl;
limited_hanoi(n, 'a', 'b', 'c');
cout << "-------------------" << endl;
cout << "num_hanoi:" << num_hanoi << endl;
cout << "num_limited_hanoi:" << num_limited_hanoi << endl;
return 0;
}