扫雷游戏实现(递归) — C语言

LEKYE

已于 2023-05-11 14:40:23 修改

阅读量166

点赞数 7

文章标签：游戏

于 2023-05-11 00:06:29 首次发布

本文链接：https://blog.csdn.net/LeEKyee/article/details/130612418

版权

1.扫雷游戏简单介绍

简单介绍 C语言扫雷游戏的的实现，经过三子棋的锻炼，目前来说比较难理解的应该是扫雷展开的递归延伸，后序将用图片展开来解析代码。

图片没有完全做完，因为递归太多次，脑细胞有点不够用了而且作图很累，最后直接上了最终结果图。

递归算法基本copy于

C语言扫雷（递归展开）（详细注释）（完整代码）_扫雷代码_AAAAA_73的博客-CSDN博客c语言扫雷游戏https://blog.csdn.net/AAAAA_9/article/details/126118881?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522168378365116800186550673%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=168378365116800186550673&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-126118881-null-null.142^v86^control,239^v2^insert_chatgpt&utm_term=%E6%89%AB%E9%9B%B7%E9%80%92%E5%BD%92&spm=1018.2226.3001.4187

2.扫雷游戏代码

2.1 game.c

#define _CRT_SECURE_NO_WARNINGS 1
#include"game.h"


void InitBoard(char board[][COLS], int rows, int cols, char ret)
{
	for ( int i = 0;  i < rows;  i++)
	{
		for (int j = 0; j < cols; j++)
		{
			board[i][j] = ret;
		}
	}
	//board[1][1] = '2';
}

void DipBoard(char board[][COLS], int row, int col)
{
	
	for ( int i = 0;  i <= row;  i++)
	{
		printf("%d ", i);
		
	}

	for (int i = 1; i <= row; i++)
	{
		printf("\n");
		printf("%d", i );
		for (int j = 1; j <= col; j++)
		{
			printf(" %c",board[i][j]);
		}
	}

	printf("\n");
}

void SetMind(char board[][COLS], int row, int col)
{
	int n = Easyn;
	while (n)
	{
		int x = rand() % row + 1;
		int y = rand() % col + 1;

		if (board[x][y] == '0')
		{
			board[x][y] = '1';
			n--;
		}
	}
}

void my_SetMind(char board[][COLS], int row, int col)
{
	board[1][3] = '1';
	board[2][4] = '1';
	board[2][9] = '1';
	board[4][2] = '1';
	board[4][4] = '1';
	board[4][7] = '1';
	board[6][6] = '1';
	board[7][2] = '1';
	board[8][8] = '1';
}

//int get_mine_count(char arr[ROWS][COLS], int row, int col)
//{
//	int i = 0;
//	int j = 0;
//	int count = 0;
//	for (i = -1; i <= 1; i++)
//	{
//		for (j = -1; j <= 1; j++)
//		{
//			if ('1' == arr[row + i][col + j])
//				count++;
//		}
//	}
//
//	return count;
//}

static int get_mine_count(char mine[ROWS][COLS], int x, int y)
{
	return mine[x - 1][y - 1] + mine[x - 1][y] + mine[x - 1][y + 1]
		+ mine[x][y - 1] + mine[x][y + 1]
		+ mine[x + 1][y - 1] + mine[x + 1][y] + mine[x + 1][y + 1] - 8 * '0';
}



void FindMind(char show[][COLS], char mine[][COLS], int col, int row)
{
	int x = 0, y = 0, iswin = 0;

	while (iswin < row * col - Easyn)
	{
		printf("请按行列顺序输入要排查的坐标：\n");
		scanf("%d%d", &x, &y);
		if (x >= 1 && x <= 9 && y >= 1 && y <= 9)
		{
			if ('1' == show[x][y])
			{
				printf("是雷！被炸了！！！\n");
				DipBoard(mine, ROW, COL);
				break;
			}
			else
			{
				iswin++;
				expandfind(mine, show, row, col, x, y);
				DipBoard(show, row, col);
			}
		}
		else
			printf("坐标非法，请重新输入：");
	}


}

//递归展开
void expandfind1(char mine[ROWS][COLS], char show[ROWS][COLS], int x, int y, int* pw)
{
	//1. 无雷递归
	//2. 有雷统计
	if (x >= 1 && x <= ROW && y >= 1 && y <= COL)
	{
		int count = get_mine_count(mine, x, y);

		if (0 == count)
		{
			show[x][y] = ' ';

			int i = 0;
			for (i = x - 1; i <= x + 1; i++);
			{
				int j = 0;
				for (j = y - 1; j <= y + 1; j++)
				{
					if (show[i][j] == '*')
					{
						expandfind(mine, show, x, y, pw);
					}
				}
			}
		}
		else
		{
			show[x][y] == count + '0';
		}
		(*pw)++;//只要进入无雷判断，pw就自行++;
	}
}

2.2 game.h

#define _CRT_SECURE_NO_WARNINGS 1
#pragma once
#include<stdio.h>
#include<math.h>

#define ROWS 11
#define COLS 11
#define ROW 9
#define COL 9

#define Easyn 10


//初始化棋盘
void InitBoard(char board[][COLS], int rows,int cols,char ret);

//打印棋盘
void DipBoard(char board[][COLS], int rows, int cols);

//设置雷
void SetMind(char board[][COLS], int rows, int cols);

//找雷
void FindMind(char show[][COLS], char mine[][COLS], int col, int row);


//找雷的递归延伸
void expandfind1(char mine[ROWS][COLS], char show[ROWS][COLS], int x, int y, int* pw);

2.3 test.c

#define _CRT_SECURE_NO_WARNINGS 1
#include"game.h"

void menu()
{
	printf("\n----------------------------\n");
	printf("---------- 1.Play ----------\n");
	printf("---------- 0.Exit ----------\n");
	printf("----------------------------\n");
}
void game()
{
	char show[ROWS][COLS];
	char mine[ROWS][COLS];

	InitBoard(show, ROWS, COLS, '*');
	InitBoard(mine, ROWS, COLS, '0');
	//DipBoard(show, ROW, COL);
	
	my_SetMind(mine, ROW, COL);
	DipBoard(show, ROW, COL);
	DipBoard(mine, ROW, COL);
	FindMind(show, mine, ROW, COL);

	
}
int main()
{
	int input = 0;
	srand((unsigned int)time(NULL));
	do
	{
		menu();
		printf("请选择：> ");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			printf("Sam Game\n");
			game();
			break;
		case 0:
			printf("Exit\n");
			break;
		default:
			printf("option error\n");
			break;
		}

	} while (input);

	return 0;
}