汉诺塔

hangyejiadao

于 2018-12-04 20:14:02 发布

阅读量182

点赞数

CC 4.0 BY-SA版权

分类专栏： c++

本文链接：https://blog.youkuaiyun.com/hangyejiadao/article/details/84797946

c++ 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个使用C++解决汉诺塔问题的程序。该程序通过递归算法实现盘子从源柱移动到目标柱的过程，并详细记录每一步移动。用户可以输入任意数量的盘子来观察移动步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<valarray>
#include<iomanip>
using namespace std;
void move(unsigned n, unsigned& moveNumber, char source, char spare, char destination) {

	if (n == 1)
	{
		moveNumber++;
		cout << setw(3) << moveNumber << ". Move the top disk from " << source << " to " << destination << endl;
	}
	else
	{
		move(n - 1, moveNumber, source,  destination, spare);
		move(1, moveNumber, source,spare, destination);
		move(n - 1, moveNumber, spare,source, destination);

	}
}
int main() {

	const char PEG1 = 'A';const char PEG2 = 'B'; const char PEG3 = 'C';
	unsigned moveNumber = 0;
	cout << "This program solves the Hanoi Towers puzzle .\n.\n";
	cout << "Enter the number of disks:";
	int numDisks;
	cin >> numDisks;
	cout << endl;

	move(numDisks, moveNumber, PEG1, PEG2, PEG3); 
	system("pause");
	return 0;
}