扫雷游戏扩展之周围也没有雷，可以展开周围的⼀⽚

1，代码展示

game.h

#pragma once

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<stdbool.h>

#define EASY_COUNT 10

#define ROW 9
#define COL 9

#define ROWS ROW+2
#define COLS COL+2

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

//打印棋盘
void DisplayBoard(char board[ROWS][COLS], int row, int col);

//布置雷
void SetMine(char board[ROWS][COLS],int row,int col);

//排查雷
void FindBoard(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col);
//递归探索函数
void recurveSearch(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y);

//判断当前位置的外围有没有地雷，如果有返回>0,没有返回0
int GetMineCount(char mine[ROWS][COLS], int x, int y);

bool isWin(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col);

game.cpp

#include"game.h"

//初始化棋盘
void InitBoard(char board[ROWS][COLS], int rows, int cols, char set)
{
	int i = 0;
	for (i = 0; i < rows; i++)
	{
		int j = 0;
		for (j = 0; j < cols; j++)
		{
			board[i][j] = set;
		}
	}
}

//打印棋盘
void DisplayBoard(char board[ROWS][COLS], int row, int col)
{
	int i = 0;
	printf("--------扫雷游戏---------\n");
	for (i = 0; i <= col; i++)
	{
		printf("%d ", i);
	}
	printf("\n");//缺少可能会使所有编号出现在同一行
	for (i = 1; i <= row; i++)
	{
		printf("%d ", i);
		int j = 0;
		for (j = 1; j <= col; j++)
		{
			printf("%c ", board[i][j]);
		}
		printf("\n");
	}
}

//布置雷
void SetMine(char board[ROWS][COLS], int row, int col)
{
	//布置十个雷
	//生成随机的坐标来布置雷
	int count = EASY_COUNT;
	while (count)
	{
		int x = rand() % row + 1;//1到9
		int y = rand() % col + 1;//1到9

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

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

//排查雷
void FindBoard(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col)
{
	int x = 0;
	int y = 0;
	int i = 0;
	int win = 0;
	while (win < row * col - EASY_COUNT)
	{
		printf("请输入要排查的坐标：");
		scanf_s("%d %d", &x, &y);
		if (x >= 1 && x <= row && y >= 1 && y <= col)
		{
			if (mine[x][y] == '1')
			{
				i++;
				if (i == 1)
				{
					printf("你已经被炸死了，还有最后一次机会！！！\n");
					continue;
				}
				
				//展示数据
				DisplayBoard(mine, ROW, COL);
				printf("出师未捷身先死，游戏结束，很遗憾.....\n");
				return;
			}
			else
			{
				//该位置不是雷，我们就排查周围有几个雷
				int count = GetMineCount(mine, x, y);
				show[x][y] = count + '0';
				//递归探索
				recurveSearch(show, mine, row, col, x, y);
				//显示函数
				DisplayBoard(show, ROW, COL);
				if (isWin(show, mine, row, col) == true)
				{
					break;
				}
				win++;
			}
		}
		else
		{
			printf("坐标超出范围，请重新输入\n");
		}
	}
	if (win == row * col - EASY_COUNT)
	{
		printf("恭喜你，排雷成功\n");
		DisplayBoard(mine, ROW, COL);
	}
}

void recurveSearch(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y)
{
	//递归结束的条件：1，遇到了空白格 2，当前格子外围有地雷
	if (x >= 1 && x <= row && y >= 1 && y <= col)
	{
		if (show[x][y] == ' ')
		{
			return;
		}
		else if (GetMineCount(mine,x,y)!= 0)
		{
			show[x][y] = GetMineCount(mine, x, y)+'0';
			return;
		}
		show[x][y] = ' ';
		recurveSearch(show, mine, row, col, x - 1, y - 1);
		recurveSearch(show, mine, row, col, x - 1, y );
		recurveSearch(show, mine, row, col, x - 1, y + 1);
		recurveSearch(show, mine, row, col, x , y - 1);
		recurveSearch(show, mine, row, col, x , y + 1);
		recurveSearch(show, mine, row, col, x +1, y - 1); 
		recurveSearch(show, mine, row, col, x + 1, y );
		recurveSearch(show, mine, row, col, x + 1, y +1);
	}
}


bool isWin(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col)
{
	for (int i = 1; i <= row; i++)
	{
		//当前位置是不是地雷，或者有没有被探索出来
		for (int j = 1; j <= col; j++)
		{
			if (mine[i][j] == '1' || mine[i][j] == '0' && show[i][j] != '*')
			{
				continue;
			}
			else
			{
				return false;
			}
		}
	}
	return true;
}

test.cpp

#include"game.h"

void game()
{
	//创建二维数组
	char mine[ROWS][COLS] = { 0 };//用来存放布置好的雷的信息
	char show[ROWS][COLS] = { 0 };//用来存放排查出的雷的个数信息

	//初始化棋盘
	InitBoard(mine, ROWS, COLS, '0');//mine数组最开始全是‘0’
	InitBoard(show, ROWS, COLS, '*');//show数组最开始全是‘*’

	//打印棋盘
	//DisplayBoard(mine, ROW, COL);
	DisplayBoard(show, ROW, COL);

	//布置雷
	SetMine(mine, ROW, COL);

	//排查雷
	FindBoard(mine, show, ROW, COL);
}

//菜单
void menu()
{
	printf("****************************\n");
	printf("****************************\n");
	printf("**********1. play***********\n");
	printf("**********2，exit***********\n");
	printf("****************************\n");
	printf("****************************\n");
}


int main()
{
	int input = 0;
	srand((unsigned int)time(NULL));
	do
	{
		menu();
		printf("请选择：>\n");
		scanf_s("%d", &input);
		switch (input)
		{
		case 1:
			game();
			break;
		case 0:
			printf("退出游戏\n");
			break;
		default:
			printf("选择错误，请重新选择\n");
			break;
		}
	} while (input);


	return 0;
}

2,效果展示

3，扩展点

扩展了递归探索函数和判断函数

void recurveSearch(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y)
{
	//递归结束的条件：1，遇到了空白格 2，当前格子外围有地雷
	if (x >= 1 && x <= row && y >= 1 && y <= col)
	{
		if (show[x][y] == ' ')
		{
			return;
		}
		else if (GetMineCount(mine,x,y)!= 0)
		{
			show[x][y] = GetMineCount(mine, x, y)+'0';
			return;
		}
		show[x][y] = ' ';
		recurveSearch(show, mine, row, col, x - 1, y - 1);
		recurveSearch(show, mine, row, col, x - 1, y );
		recurveSearch(show, mine, row, col, x - 1, y + 1);
		recurveSearch(show, mine, row, col, x , y - 1);
		recurveSearch(show, mine, row, col, x , y + 1);
		recurveSearch(show, mine, row, col, x +1, y - 1); 
		recurveSearch(show, mine, row, col, x + 1, y );
		recurveSearch(show, mine, row, col, x + 1, y +1);
	}
}


bool isWin(char show[ROWS][COLS], char mine[ROWS][COLS], int row, int col)
{
	for (int i = 1; i <= row; i++)
	{
		//当前位置是不是地雷，或者有没有被探索出来
		for (int j = 1; j <= col; j++)
		{
			if (mine[i][j] == '1' || mine[i][j] == '0' && show[i][j] != '*')
			{
				continue;
			}
			else
			{
				return false;
			}
		}
	}
	return true;
}

4

在扫雷游戏代码的实现过程-CSDN博客可找到简易版本，后续还会继续扩展其他版本