扫雷问题（可实现展开）
1.代码要实现几个功能：
第一下扫雷时，即使踩中了雷也不能直接炸死;
扫雷时，坐标周围没有雷的地方可以实现展开；
2.程序结构图
3.分析游戏，建立两个棋盘，一个放置雷一个用户游戏界面
4.test.c
#define _CRT_SECURE_NO_WARNINGS 1
#include "game.h"
void menu()
{
printf("****************************\n");
printf("**** 1. play ****\n");
printf("**** 0. exit ****\n");
printf("****************************\n");
}
void game()
{
char mine[ROWS][COLS] = { 0 };//雷的信息
char show[ROWS][COLS] = { 0 };//显示排查出的雷的个数
//初始化
InitBoard(mine, ROWS, COLS, '0');
InitBoard(show, ROWS, COLS, '*');
Display(show, ROW, COL);
//布置雷
SetMine(mine, ROW, COL);
Display(mine, ROW, COL);
//排查雷
FindMine(mine, show, ROW, COL);
}
void Test()
{
int input = 0;
srand((unsigned int)time(NULL));
do
{
menu();
printf("请选择:>");
scanf("%d", &input);
switch (input)
{
case 1:
game();
break;
case 0:
printf("退出游戏\n");
break;
default:
printf("选择错误\n");
break;
}
} while (input);
}
int main()
{
Test();
return 0;
}
5.建立棋盘，雷盘
void InitBoard(char board[ROWS][COLS], int rows, int cols, char set)
{
int i = 0;
int j = 0;
for (i = 0; i < rows; i++)
{
for (j = 0; j < cols; j++)
{
board[i][j] = set;
}
}
}
6.显示棋盘
void Display(char board[ROWS][COLS], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i <= col; i++)
{
printf("%d ", i);
}
printf("\n");
for (i = 1; i <= row; i++)
{
printf("%d ", i);
for (j = 1; j <= col; j++)
{
printf("%c ", board[i][j]);
}
printf("\n");
}
printf("\n");
}
7.建立雷阵
利用函数 strand() 函数和 rand() 函数在棋盘上随机地方布置雷，有雷的地方标记为 1 ，没有雷的地方标记为 0。
void SetMine(char board[ROWS][COLS], int row, int col)
{
int count = EASY_COUNT;
while (count)
{
int x = rand() % row + 1;
int y = rand() % col + 1;
if (board[x][y] == '0')
{
board[x][y] = '1';
count--;
}
}
}
8.判断周围雷的个数
因为是char类型数组，中间存的是字符串‘0’，则判断周围八个区域减去一个八个‘0’就为周围雷的个数
int GetMineCount(char board[ROWS][COLS], int x, int y)
{
return board[x - 1][y] +
board[x - 1][y - 1] +
board[x][y - 1] +
board[x + 1][y - 1] +
board[x + 1][y] +
board[x + 1][y + 1] +
board[x][y + 1] +
board[x - 1][y + 1] - 8 * '0';
}
9.展开周围空白
扫雷时，坐标周围没有雷的地方展开，并统计展开的地方边缘处可能存在的雷的个数。
先统计雷周围雷的的数，如果为 0，则排除这个区域即置为 ‘ ’ ，并递归周围的 8 个位置，如果还出现为 0 的情况则继续递归
void NoMine(char mine[ROWS][COLS], char show[ROWS][COLS], int x, int y)
{
int ret = GetMineCount(mine, x, y);
if (ret == 0)
{
show[x][y] = ' ';
if ((x - 1) > 0 && (y - 1) > 0 && (show[x - 1][y - 1] == '*'))
NoMine(mine, show, x - 1, y - 1);
if ((x - 1) > 0 && (y) > 0 && (show[x - 1][y] == '*'))
NoMine(mine, show, x - 1, y);
if ((x - 1) > 0 && (y + 1) > 0 && (show[x - 1][y + 1] == '*'))
NoMine(mine, show, x - 1, y + 1);
if ((x) > 0 && (y - 1) > 0 && (show[x][y - 1] == '*'))
NoMine(mine, show, x, y - 1);
if ((x) > 0 && (y + 1) > 0 && (show[x][y + 1] == '*'))
NoMine(mine, show, x, y + 1);
if ((x + 1) > 0 && (y - 1) > 0 && (show[x + 1][y - 1] == '*'))
NoMine(mine, show, x + 1, y - 1);
if ((x + 1) > 0 && (y) > 0 && (show[x + 1][y] == '*'))
NoMine(mine, show, x + 1, y);
if ((x + 1) > 0 && (y + 1) > 0 && (show[x + 1][y + 1] == '*'))
NoMine(mine, show, x + 1, y + 1);
}
else
show[x][y] = ret + '0';
}
9.game.h完整代码块
#define _CRT_SECURE_NO_WARNINGS 1
#include "game.h"
void InitBoard(char board[ROWS][COLS], int rows, int cols, char set)
{
int i = 0;
int j = 0;
for (i = 0; i < rows; i++)
{
for (j = 0; j < cols; j++)
{
board[i][j] = set;
}
}
}
void Display(char board[ROWS][COLS], int row, int col)
{
int i = 0;
int j = 0;
for (i = 0; i <= col; i++)
{
printf("%d ", i);
}
printf("\n");
for (i = 1; i <= row; i++)
{
printf("%d ", i);
for (j = 1; j <= col; j++)
{
printf("%c ", board[i][j]);
}
printf("\n");
}
printf("\n");
}
void SetMine(char board[ROWS][COLS], int row, int col)
{
int count = EASY_COUNT;
while (count)
{
int x = rand() % row + 1;
int y = rand() % col + 1;
if (board[x][y] == '0')
{
board[x][y] = '1';
count--;
}
}
}
int GetMineCount(char board[ROWS][COLS], int x, int y)
{
return board[x - 1][y] +
board[x - 1][y - 1] +
board[x][y - 1] +
board[x + 1][y - 1] +
board[x + 1][y] +
board[x + 1][y + 1] +
board[x][y + 1] +
board[x - 1][y + 1] - 8 * '0';
}
void NoMine(char mine[ROWS][COLS], char show[ROWS][COLS], int x, int y)
{
int ret = GetMineCount(mine, x, y);
if (ret == 0)
{
show[x][y] = ' ';
if ((x - 1) > 0 && (y - 1) > 0 && (show[x - 1][y - 1] == '*'))
NoMine(mine, show, x - 1, y - 1);
if ((x - 1) > 0 && (y) > 0 && (show[x - 1][y] == '*'))
NoMine(mine, show, x - 1, y);
if ((x - 1) > 0 && (y + 1) > 0 && (show[x - 1][y + 1] == '*'))
NoMine(mine, show, x - 1, y + 1);
if ((x) > 0 && (y - 1) > 0 && (show[x][y - 1] == '*'))
NoMine(mine, show, x, y - 1);
if ((x) > 0 && (y + 1) > 0 && (show[x][y + 1] == '*'))
NoMine(mine, show, x, y + 1);
if ((x + 1) > 0 && (y - 1) > 0 && (show[x + 1][y - 1] == '*'))
NoMine(mine, show, x + 1, y - 1);
if ((x + 1) > 0 && (y) > 0 && (show[x + 1][y] == '*'))
NoMine(mine, show, x + 1, y);
if ((x + 1) > 0 && (y + 1) > 0 && (show[x + 1][y + 1] == '*'))
NoMine(mine, show, x + 1, y + 1);
}
else
show[x][y] = ret + '0';
}
void FindMine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col)
{
int x = 0;
int y = 0;
int win = 0;
while (win < row*col - EASY_COUNT)
{
printf("请输入排查的坐标:>");
scanf("%d%d", &x, &y);
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
if (mine[x][y] == '1')
{
printf("很遗憾，你被炸死了\n");
Display(mine, row, col);
break;
}
else
{
if (mine[x][y] == '0' && show[x][y] == '*')
{
NoMine(mine, show, x , y);
Display(show, ROW,COL);
win = win + 8;
}
}
}
else
{
printf("坐标非法,请重新输入!\n");
}
}
if (win >= row * col - EASY_COUNT)
{
printf("恭喜你， 排雷成功\n");
Display(mine, row, col);
}
}
10.头文件
#define _CRT_SECURE_NO_WARNINGS 1
#include