devbox
木道寻08
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

控制台版扫雷程序_控制台启动扫雷代码

作者：木道寻08 | 2024-06-23 06:03:31

赞

踩

控制台启动扫雷代码

测试平台： WIN7

工具: VC6.0 , VS2008都能编译得过。

花了两天时间写的，里面涉及的算法大都是自己想的，所以可能有些BUG。

如果出现错误请提醒，鞠躬，谢谢！

  1. #include <iostream>
  2. #include <time.h>
  3. #include <windows.h>
  4. using namespace std;
  5.  
  6. #pragma comment (linker,"/subsystem:console")
  7.  
  8. #define BLACK 0		//空白
  9. #define MINE 100	//地雷
  10. #define NOSWEEP 0	//未扫过
  11. #define SWEEP 1		//扫雷
  12. #define FLAG 2		//标记
  13.  
  14. class WinMine
  15. {
  16. public:
  17.  
  18. 	WinMine(int iRow, int iColumn);
  19. 	~WinMine();
  20. public:
  21. 	void InitMine(int iMineMax);
  22. 	void SetColor();
  23. 	void StatisticsMine();
  24. 	void Map();
  25. 	bool OpenWhites(int x, int y, int status);
  26. 	void GameStart(int iMineMax);
  27. 	void GameOver();
  28. 	bool GoodOver();
  29. private:
  30. 	int **m_ppMine;
  31. 	int **m_ppSweep;
  32. 	bool m_bMineflag;
  33. 	bool m_bSweepflag;
  34. 	int m_row;
  35. 	int m_column;
  36. 	int m_minenum;
  37. };
  38.  
  39. int main(void)
  40. {
  41. 	system("color 0d");
  42. 	while (true)
  43. 	{
  44. 		int level;
  45. 		WinMine *Mine;
  46. 		cout << "请输入游戏等级:" <<endl;
  47. 		cout << "1.初级" <<endl;
  48. 		cout << "2.中级" <<endl;
  49. 		cout << "3.高级" <<endl;
  50. 		cout << "4.退出" <<endl;
  51. 		cin >> level;
  52. 		if (level == 1)
  53. 		{
  54. 			Mine = new WinMine(9,9);
  55. 			Mine->GameStart(10);
  56. 		}
  57. 		else if (level == 2)
  58. 		{
  59. 			Mine = new WinMine(16,16);
  60. 			Mine->GameStart(40);
  61. 		}
  62. 		else if (level == 3)
  63. 		{
  64. 			Mine = new WinMine(16,30);
  65. 			Mine->GameStart(70);
  66. 		}
  67. 		else if (level == 4)
  68. 		{
  69. 			return 0;
  70. 		}
  71. 		else 
  72. 		{
  73. 			cout << "输入错误！" <<endl;
  74. 			continue;
  75. 		}
  76. 		delete Mine;
  77. 	}
  78.  
  79. 	return 0;
  80. }
  81.  
  82. WinMine::WinMine(int iRow, int iColumn)
  83. {
  84. 	int i;
  85. 	
  86. 	//储雷状态
  87. 	m_ppMine = (int **) new int[iRow]; if (!m_ppMine) return;
  88. 	m_ppMine[0] = new int[iRow * iColumn]; if (!*m_ppMine) { delete[] m_ppMine; m_ppMine = NULL; return;}
  89. 	m_bMineflag = true;
  90.  
  91. 	//扫雷状态
  92. 	m_ppSweep = (int **) new int[iRow]; if (!m_ppSweep) return;
  93. 	m_ppSweep[0] = new int[iRow * iColumn]; if (!*m_ppSweep) { delete[] m_ppSweep; m_ppSweep = NULL; return;}
  94. 	m_bSweepflag = true;
  95.  
  96. 	m_row = iRow; m_column = iColumn;
  97. 	
  98. 	for (i = 1; i < iRow; i++)
  99. 	{
  100. 		m_ppMine[i] = m_ppMine[0] + i * iRow;
  101. 	}
  102.  
  103. 	for (i = 1; i < iRow; i++)
  104. 	{
  105. 		m_ppSweep[i] = m_ppSweep[0] + i * iRow;
  106. 	}
  107.  
  108. 	memset(m_ppSweep[0], 0, iRow * iColumn * sizeof(int));
  109. 	memset(m_ppMine[0], 0, iRow * iColumn * sizeof(int));
  110. 	
  111. }
  112.  
  113. WinMine::~WinMine()
  114. {
  115. 	if (m_bMineflag)
  116. 	{
  117. 		if (m_ppMine[0]) delete[] m_ppMine[0];
  118. 		if (m_ppMine) delete[] m_ppMine;
  119. 	}
  120. 	if (m_bSweepflag)
  121. 	{
  122. 		if (m_ppSweep[0]) delete[] m_ppSweep[0];
  123. 		if (m_ppSweep) delete[] m_ppSweep;
  124. 	}
  125. }
  126.  
  127. //设置颜色
  128. void WinMine::SetColor()
  129. {
  130. 	system("color 0a");
  131. }
  132.  
  133. //初始化雷数
  134. void WinMine::InitMine(int iMineMax)	
  135. {
  136. 	int x, y,num = 0;
  137. 	srand( (unsigned)time(NULL) );
  138. 	for (int i = 0; num != iMineMax; i++)
  139. 	{
  140. 		x = rand()%m_row;
  141. 		y = rand()%m_column;
  142. 		if (MINE != m_ppMine[x][y])
  143. 		{
  144. 			m_ppMine[x][y] = MINE;
  145. 			num++;
  146. 		}
  147. 	}
  148. 	m_minenum = num;
  149.  
  150. }
  151.  
  152. //统计雷数
  153. void WinMine::StatisticsMine()
  154. {
  155. 	int i, j;
  156. 	int n, m;
  157. 	int num = 0; //保存雷数
  158.  
  159. 	//中间
  160. 	for ( i = 1; i < m_row - 1; i++)
  161. 	{
  162. 		for ( j = 1; j < m_column - 1; j++)
  163. 		{
  164. 			if ( m_ppMine[i][j] == BLACK)
  165. 			{
  166. 				for (n = i - 1; n <= i + 1; n++)
  167. 				{
  168. 					for (m = j - 1; m <= j + 1; m++)
  169. 					{
  170. 						if ( m_ppMine[n][m] == MINE )
  171. 							num++;
  172.  
  173. 					}
  174. 				}
  175. 				m_ppMine[i][j] = num;
  176. 				num = 0;
  177. 			}
  178.  
  179. 		}
  180. 	}
  181.  
  182. 	//顶边
  183. 	for ( i = 1; i < m_column - 1; i++)
  184. 	{
  185. 		if (m_ppMine[0][i] == BLACK)
  186. 		{
  187. 			for (n = 0; n < 2; n++)
  188. 			{
  189. 				for (m = i - 1; m <= i + 1; m++)
  190. 				{
  191. 					if (m_ppMine[n][m] == MINE)
  192. 						num++;
  193. 				}
  194. 			}
  195. 			m_ppMine[0][i] = num;
  196. 			num = 0;
  197. 		}
  198. 	}
  199.  
  200. 	//下边
  201. 	for ( i = 1; i < m_column - 1; i++)
  202. 	{
  203. 		if (m_ppMine[m_row - 1][i] == BLACK)
  204. 		{
  205. 			for (n = m_row - 2; n < m_row; n++)
  206. 			{
  207. 				for (m = i - 1; m <= i + 1; m++)
  208. 				{
  209. 					if (m_ppMine[n][m] == MINE)
  210. 						num++;
  211. 				}
  212. 			}
  213. 			m_ppMine[m_row - 1][i] = num;
  214. 			num = 0;
  215. 		}
  216. 	}
  217.  
  218. 	//左边
  219.  
  220. 	for ( i = 1; i < m_row - 1; i++ )
  221. 	{
  222. 		if (m_ppMine[i][0] == BLACK)
  223. 		{
  224. 			for (n = i - 1; n <= i + 1; n++)
  225. 			{
  226. 				for (m = 0; m < 2; m++)
  227. 					if (m_ppMine[n][m] == MINE)
  228. 						num++;	
  229. 			}
  230.  
  231. 			m_ppMine[i][0] = num;
  232. 			num = 0;
  233. 		}
  234. 	}
  235.  
  236. 	//右边
  237. 	for ( i = 1; i < m_row - 1; i++ )
  238. 	{
  239. 		if (m_ppMine[i][m_column - 1] == BLACK)
  240. 		{
  241. 			for (n = i - 1; n <= i + 1; n++)
  242. 			{
  243. 				for (m = m_column - 2; m < m_column; m++)
  244. 				{
  245. 					if (m_ppMine[n][m] == MINE)
  246. 						num++;
  247. 				}
  248. 			}
  249. 			m_ppMine[i][m_column - 1] = num;
  250. 			num = 0;
  251. 		}
  252. 	}
  253.  
  254. 	//左上角
  255. 	if (m_ppMine[0][0] != MINE)
  256. 	{
  257. 		if (m_ppMine[0][1] == MINE)
  258. 			num++;
  259. 		if (m_ppMine[1][1] == MINE)
  260. 			num++;
  261. 		if (m_ppMine[1][0] == MINE)
  262. 			num++;
  263. 		m_ppMine[0][0] = num;
  264. 		num = 0;
  265. 	}
  266.  
  267.  
  268. 	//左下角
  269.  
  270. 	if (m_ppMine[m_row - 1][0] != MINE)
  271. 	{
  272. 		if (m_ppMine[m_row - 2][0] == MINE)
  273. 			num++;
  274. 		if (m_ppMine[m_row - 2][1] == MINE)
  275. 			num++;
  276. 		if (m_ppMine[m_row - 1][1] == MINE)
  277. 			num++;
  278. 		m_ppMine[m_row - 1][0] = num;
  279. 		num = 0;
  280. 	}
  281.  
  282. 	//右上角
  283. 	if (m_ppMine[0][m_column - 1] != MINE)
  284. 	{
  285. 		if (m_ppMine[1][m_column - 1] == MINE)
  286. 			num++;
  287. 		if (m_ppMine[1][m_column - 2] == MINE)
  288. 			num++;
  289. 		if (m_ppMine[0][m_column - 2] == MINE)
  290. 			num++;
  291. 		m_ppMine[0][m_column - 1] = num;
  292. 		num = 0;
  293. 	}
  294.  
  295. 	//右下角
  296. 	if (m_ppMine[m_row - 1][m_column - 1] != MINE)
  297. 	{
  298. 		if (m_ppMine[m_row - 2][m_column - 1] == MINE)
  299. 			num++;
  300. 		if (m_ppMine[m_row - 2][m_column - 2] == MINE)
  301. 			num++;
  302. 		if (m_ppMine[m_row - 1][m_column - 2] == MINE)
  303. 			num++;
  304. 		m_ppMine[m_row - 1][m_column - 1] = num;
  305. 		num = 0;
  306. 	}
  307. }
  308.  
  309. //展开空白
  310. bool WinMine::OpenWhites(int row, int column, int status)
  311. {
  312. 	if (row < 0 || row > (m_row - 1) || column < 0 || column > (m_column - 1))
  313. 		return true;
  314. 	if (status == SWEEP &&  m_ppMine[row][column] == MINE)
  315. 	{
  316. 		return false;
  317. 	}
  318.  
  319. 	if (status == FLAG)
  320. 	{
  321. 		m_ppSweep[row][column] = FLAG;
  322. 		return true;
  323. 	}
  324.  
  325. 	if (m_ppSweep[row][column] == NOSWEEP && m_ppMine[row][column] != MINE)
  326. 	{
  327.  
  328. 		if (m_ppMine[row][column] > 0)
  329. 		{
  330. 			m_ppSweep[row][column] = SWEEP; 
  331. 			return true;
  332. 		}
  333. 		else
  334. 		{
  335. 			m_ppSweep[row][column] = SWEEP;
  336. 			OpenWhites(row-1, column, status);
  337. 			OpenWhites(row-1, column-1, status);
  338. 			OpenWhites(row-1, column+1, status);
  339. 			OpenWhites(row, column-1, status);
  340. 			OpenWhites(row, column+1, status);
  341. 			OpenWhites(row+1, column, status);
  342. 			OpenWhites(row+1, column-1, status);
  343. 			OpenWhites(row+1, column+1, status);
  344. 		}
  345. 	}
  346. 	return true;
  347. }
  348.  
  349. //地图
  350. void WinMine::Map()
  351. {
  352. 	SetColor();
  353. 	int i, j;
  354. 	for ( i = 0; i < m_row; i++)
  355. 	{
  356. 		for (j = 0; j < m_column; j++)
  357. 		{
  358. 			if (m_ppSweep[i][j] == SWEEP)
  359. 			{
  360. 				if (m_ppMine[i][j] == 0)
  361. 				{
  362. 					cout << "□";
  363. 				}
  364. 				else if (m_ppMine[i][j] == 1)
  365. 				{
  366. 					cout << "①";
  367. 				}
  368. 				else if (m_ppMine[i][j] == 2)
  369. 				{
  370. 					cout << "②";
  371. 				}
  372. 				else if (m_ppMine[i][j] == 3)
  373. 				{
  374. 					cout << "③";
  375. 				}
  376. 				else if (m_ppMine[i][j] == 4)
  377. 				{
  378. 					cout << "④";
  379. 				}
  380. 				else if (m_ppMine[i][j] == 5)
  381. 				{
  382. 					cout << "⑤";
  383. 				}
  384. 				else if (m_ppMine[i][j] == 6)
  385. 				{
  386. 					cout << "⑥";
  387. 				}
  388. 				else if (m_ppMine[i][j] == 7)
  389. 				{
  390. 					cout << "⑦";
  391. 				}
  392. 				else if (m_ppMine[i][j] == 8)
  393. 				{
  394. 					cout << "⑧";
  395. 				}	
  396.  
  397. 			}
  398. 			else if (m_ppSweep[i][j] == FLAG)
  399. 			{
  400. 				cout << "⊙";
  401. 			}
  402. 			else
  403. 				cout << "▇";
  404. 		}
  405. 		cout << endl;
  406. 	}
  407. }
  408.  
  409. //游戏结束
  410. void WinMine::GameOver()
  411. {
  412.  
  413. 	int i, j;
  414. 	for ( i = 0; i < m_row; i++)
  415. 	{
  416. 		for (j = 0; j < m_column; j++)
  417. 		{
  418. 			if (m_ppMine[i][j] == MINE)
  419. 				cout << "★";
  420. 			else 
  421. 				cout << "□";
  422. 			
  423. 		}
  424. 		cout << endl;
  425. 	}
  426. }
  427. //检查是否雷标记正确。
  428. bool WinMine::GoodOver()
  429. {
  430. 	int i, j;
  431. 	int num = 0;
  432. 	for (i = 0; i < m_row; i++)
  433. 	{
  434. 		for (j = 0; j < m_column; j++)
  435. 		{
  436. 			if (m_ppSweep[i][j] == FLAG && m_ppMine[i][j] == MINE)
  437. 				num++;
  438.  
  439. 		}
  440. 	}
  441. 	if (num == m_minenum)
  442. 		return true;
  443. 	else
  444. 		return false;
  445. }
  446.  
  447. //开始游戏
  448. void WinMine::GameStart(int iMineMax)
  449. {
  450. 	int x, y;
  451. 	int flag;
  452. begin:
  453. 	memset(m_ppSweep[0], 0, m_row * m_column * sizeof(int));
  454. 	memset(m_ppMine[0], 0, m_row * m_column * sizeof(int));
  455. 	InitMine(iMineMax);
  456. 	StatisticsMine();
  457.  
  458. 	while (true)
  459. 	{
  460. 		system("cls");
  461.  
  462. 		Map();
  463. 		cout << "请输入要扫的区域的坐标:" <<endl;
  464. 		cout << "请输入纵坐标:";cin>>x;
  465. 		cout << "请输入横坐标:";cin>>y;
  466. 		if (x <= 0 || x > m_row || y <= 0 || y > m_column)
  467. 		{
  468. 			cout <<"输入错误请重新输入" <<endl;
  469. 			Sleep(1000);
  470. 			continue;
  471. 		}
  472.  
  473. 		cout << "请输入是要做标记还是扫雷，扫雷请按1，标记请按2:" <<endl;
  474. 		cin >> flag;
  475. 		if ( false == OpenWhites(x-1, y-1, flag) )
  476. 		{
  477. 			int i;
  478. 			system("cls");
  479. 			GameOver();
  480. 			cout << "游戏结束!" <<endl;
  481. 			cout << "继续游戏请按1，退出游戏请按0:"<<endl;
  482. 			cin >> i;
  483. 			if (i == 1)
  484. 				goto begin;
  485. 			else 
  486. 				goto end;
  487. 		}
  488. 		else
  489. 		{
  490. 			if (GoodOver() == true)
  491. 			{
  492. 				int i;
  493. 				cout << "扫雷成功！" <<endl;
  494. 				cout << "继续游戏请按1，退出游戏请按0:"<<endl;
  495. 				cin >> i;
  496. 				if (i == 1)
  497. 					goto begin;
  498. 				else 
  499. 					goto end;
  500. 			}
  501. 		}
  502. 	}
  503. end:
  504. 	return;
  505. }


声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/木道寻08/article/detail/748901
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号