C语言实现扫雷
首先来讲一讲扫雷的规则:随便点一个格子,会有一块,上面的数字就代表数字周围八个格子会有几个雷,是1他周围就只有1个雷,2就有两个雷······
写代码的时候要注意构思代码的框架,每个函数实现的意义在代码中都有体现,首先看一下头文件game.h
#define ROW 9
#define COL 9
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
//防止查雷时越界,多开两行两列
#define ROWS ROW+2
#define COLS COL+2
enum Difficulty
{
EASY = 10,
MEDIUM=20,
HARD=30
};
void InitBoard(char arr[ROWS][COLS], int row, int col, char val);
void ShowBoard(char arr[ROWS][COLS], int row, int col);
//生成雷
void GenerateMine(char arr[ROWS][COLS], int row, int col, int difficulty);
//获取[i][j]位置周围的雷
int GetMine(char mine[ROWS][COLS], int i, int j);
//遇到周围没有雷时,对周围进行展开搜索
void SearchMine(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j);
第二个就是实现每一个函数game.c
#include"game.h"
void InitBoard(char arr[ROWS][COLS], int row, int col, char val)
{
for (int i = 0; i < row; ++i)
{
for (int j = 0; j < col; ++j)
{
arr[i][j] = val;
}
}
}
void ShowBoard(char arr[ROWS][COLS], int row, int col)
{
for (int i = 0; i <= row; ++i)
{
printf("%d ", i);
}
printf("\n");
for (int i = 1; i <= row; ++i)
{
printf("%d ", i);
for (int j = 1; j <= col; ++j)
{
if (arr[i][j] >= '1'&&arr[i][j] < '9')
{
printf("%c ", arr[i][j]);
}
else
{
printf("%c ", arr[i][j]);
}
}
printf("\n");
}
printf("\n");
}
void GenerateMine(char arr[ROWS][COLS], int row, int col, int difficulty)
{
while (difficulty)
{
int i = rand() % row + 1;
int j = rand() % col + 1;
if (arr[i][j] == '0')
{
arr[i][j] = '1';
--difficulty;
}
}
}
int GetMine(char mine[ROWS][COLS], int i, int j)
{
int n = mine[i - 1][j - 1] + mine[i - 1][j] + mine[i - 1][j + 1] + mine[i][j - 1] + mine[i][j + 1] + mine[i + 1][j - 1] + mine[i + 1][j] + mine[i + 1][j + 1];
return n - 8 * '0';
}
void SearchMine(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j)
{
if (i<1 || i>ROW || j<1 || j>COL)
{
return;
}
show[i][j] = ' ';
int posArr[8][2] = { { i - 1, j - 1 }, { i - 1, j }, { i - 1, j + 1 }, { i, j - 1 }, { i, j + 1 }, { i + 1, j - 1 }, { i + 1, j }, { i + 1, j + 1 } };
//8个方向空格进行搜索
for (int k = 0; k < 8; ++k)
{
int row = posArr[k][0];
int col = posArr[k][1];
//已经搜索过的位置不在探索
if ((show[row][col] >= '1'&&show[row][col] <= '8') || show[row][col] == ' ')
{
continue;
}
//1、如果此方向一圈有雷,则显示雷数量,不再往下搜索
//2、如果此方向一圈没有雷,则递归继续往它周边搜索
int mineNum = 0;
mineNum = GetMine(mine, row, col);
if (mineNum > 0)
{
show[row][col] = mineNum + '0';
}
else
{
SearchMine(mine, show, row, col);
}
}
}
其次建立test.c进行测试
#include"game.h"
#include"windows.h"
void game()
{
system("cls");
char mine[ROWS][COLS];
char show[ROWS][ROWS];
//'0'表示没有雷
InitBoard(mine, ROWS, COLS, '0');
InitBoard(show, ROWS, COLS, '*');
//srand(time(0);
GenerateMine(mine, ROW, COL, MEDIUM);
//ShowBoard(mine, ROW, COL);
//int step=ROW*COL;
//step-=MEDIUM;
//开始玩游戏
while (1)
{
ShowBoard(show, ROW, COL);
printf("请输入你要展开的坐标:");
int i, j;
scanf("%d%d", &i, &j);
if (i<1 || i>ROW || j<i || j>COL || show[i][j] != '*')
{
printf("输入坐标错误,请重新输入\n");
continue;
}
if (mine[i][j] == '1')
{
printf("你踩雷了,游戏结束\n");
ShowBoard(mine, ROW, COL);
break;
}
else
{
int mineNum = GetMine(mine ,i, j);
if (mineNum == 0)
{
//SearchMine(mine,show,i,j,step);
SearchMine(mine, show, i, j);
}
else
{
show[i][j] = mineNum + '0';
ShowBoard(show, ROW, COL);
//--step;
}
}
}
}
int main()
{
game();
return 0;
}