简易扫雷

最新推荐文章于 2024-02-03 19:42:22 发布

安羅伽

最新推荐文章于 2024-02-03 19:42:22 发布

阅读量126

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_35689566/article/details/89187466

本文详细介绍了一个简单的扫雷游戏实现过程，使用C语言编程，通过定义游戏地图和地雷分布，实现了用户交互和游戏逻辑，包括游戏菜单、初始化地图、显示地图、游戏循环等关键功能。

扫雷
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define max_row 10
#define max_col 10
#define mine_count 10
int menu() {
printf("----------------\n");
printf(“1.开始游戏 2.退出游戏\n”);
printf("---------------\n");
printf(“请输入您的选择\n”);
int choice;
scanf("%d", &choice);
return choice;
}
void Init(char show_map[max_row][max_col],char mine_map[max_row][max_col])
{
for (int row = 0; row < max_row; ++row)
{
for (int col = 0; col< max_col; ++col) {
show_map[row][col] = ‘*’;
}
}
for (int row = 0; row < max_row; ++row) {
for (int col = 0; col < max_col; ++col) {
mine_map[row][col] = ‘0’;
}
}
int n = mine_count;
while (n>0)
{
int row = rand() % max_row;
int col = rand() % max_col;
if (mine_map[row][col] == ‘1’)
{
continue;
}
mine_map[row][col] = ‘1’;
–n;
}
srand((unsigned int)time(0));
}
void updateshowmap(int row, int col, char show_map[max_row][max_col], char mine_map[max_row][max_col])
{
int count = 0;
if (row - 1 >= 0 && col - 1 >= 0 && mine_map[row - 1][col - 1] == ‘1’ && row - 1 < max_row&&col - 1 < max_col) {
++count;
}
if (row - 1 >= 0 && col >= 0 && mine_map[row - 1][col] == ‘1’ && row - 1 < max_row&&col < max_col) {
++count;
}
if (row - 1 >= 0 && col + 1 >= 0 && mine_map[row - 1][col + 1] == ‘1’ && row - 1 < max_row&&col + 1 < max_col)
{
++count;
}
if (row >= 0 && col - 1 >= 0 && mine_map[row][col - 1] == ‘1’ && row < max_row&&col - 1 < max_col) {
++count;
}
if (row >= 0 && col >= 0 && mine_map[row][col] == ‘1’ && row < max_row&&col < max_col) {
}
if (row >= 0 && col + 1 >= 0 && mine_map[row][col + 1] == ‘1’ && row < max_row&&col + 1 < max_col) {
++count;
}
if (row + 1 >= 0 && col - 1 >= 0 && mine_map[row + 1][col - 1] == ‘1’&& row - 1 < max_row&&col - 1 < max_col)
{
++count;
}
if (row + 1 >= 0 && col >= 0 && mine_map[row + 1][col ] == ‘1’&& row + 1 < max_row&&col < max_col)
{
++count;
} if (row + 1 >= 0 && col + 1 >= 0 && mine_map[row + 1][col + 1] == ‘1’&& row+ 1 < max_row&&col +1 < max_col)
{
++count;
}
show_map[row][col]=‘0’+count;

}
void printmap(char map[max_row][max_col]) {
printf(" “);
for (int i = 1; i < max_col; ++i) {
printf(”%d “, i);
}
printf(”\n");

	for (int col = 0; col <= max_col-2; ++col) {
		printf("---");
	}
	printf("\n");

for (int row = 1; row <max_row; ++row) {
	printf(" %d| ", row);
	for (int col = 1; col <max_col; ++col) {
		printf("%c ", map[row][col]);
	}
	printf("\n");
}

}
void Game()
{
char show_map[max_row][max_col];
char mine_map[max_row][max_col];
int not_mine_count_show = 0;
Init(show_map, mine_map);

while (1) {
	printmap(show_map);
	printmap(mine_map);
	printf("请输入一组坐标：\n");
	int row = 0, col = 0;
	scanf("%d,%d", &row, &col);

	//system("cls");
	if (row < 0 || row >= max_row || col < 0 || col >= max_col) {
		printf("您的输入非法！\n");
		continue;
	}
	if (show_map[row][col] != '*') {
		printf("当前位置已经翻开\n");
		continue;
	}
	if (mine_map[row][col] == '1') {
		printf("游戏结束\n");
		printmap(mine_map);
		break;
	}
	++not_mine_count_show;
	if (not_mine_count_show == max_row * max_col - mine_count) {
		printf("游戏胜利\n");
		printmap(mine_map);
		break;
	}
	updateshowmap(row, col, show_map, mine_map);

}

}

int main()
{
while (1) {
	int choice=menu();
	
	//scanf("%d", &choice);
	if (choice == 1) {
		Game();
	}
	else if (choice == 2) {
		printf("再见\n");
		break;

	}
	else {
		printf("输入有误\n");
	}
}
system("pause");
return 0;

}