当前位置:网站首页>Minesweeper game (written in c language)
Minesweeper game (written in c language)
2022-07-31 04:51:00 【Can't be white】
The minesweeper game is divided into three sections:
* test.c (主函数)
* game.c(游戏部分代码实现)
* game.h(头文件,宏定义,函数的声明)
test.c
#include"game.h"
void menu()
{
//Print the Minesweeper game catalog
printf("########################################\n");
printf("######### 1.play #########\n");
printf("######### 0.exit #########\n");
printf("########################################\n");
}
void game()
{
//设计2个数组存放信息
char mine[ROWS][COLS] = {
0 };
char show[ROWS][COLS] = {
0 };
//初始化棋盘
init_board(mine, ROWS, COLS, '0');
init_board(show, ROWS, COLS, '*');
//打印棋盘
//display_board(mine, ROW, COL);
//display_board(show, ROW, COL);
//storage mines
set_mine(mine, ROW, COL);
display_board(show, ROW, COL);//打印棋盘
//排雷
find_mine(mine, show, ROW, COL);
}
int main()
{
int input = 0;
srand((unsigned int)time(NULL));
do
{
menu();
printf("请选择>:");
scanf_s("%d", &input);
if (input == 1)
{
printf("开始游戏\n");
game();
break;
}
else if (input == 0)
{
printf("游戏结束");
break;
}
else
printf("输入错误,请从新输入\n");
} while (input);
}
##################################################################
game.c
#include"game.h"
//初始化两个数组
void init_board(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_board(char board[ROWS][COLS], int row, int col)
{
int i = 0;
int j = 0;
for (j = 0; j <= col; j++)
{
printf("%d ", j);
}
printf("\n");
for (i = 1; i <= row; i++)
{
printf("%d ", i);
for (j = 1; j <= col; j++)
{
printf("%c ", board[i][j]);
}
printf("\n");
}
}
//布置雷
void set_mine(char mine[ROWS][COLS], int row, int col)
{
//布置10个雷
int count = EASY_COUNT;
while (count)
{
int x = rand() % row + 1;
int y = rand() % col + 1;
if (mine[x][y] == '0')
{
mine[x][y] = '1';
count--;
}
}
}
//Count how many mines there are in a circle around the coordinates you entered
int get_mine_count(char mine[ROWS][COLS], int x, int y)
{
return (mine[x - 1][y] +
mine[x - 1][y - 1] +
mine[x][y - 1] +
mine[x + 1][y - 1] +
mine[x + 1][y] +
mine[x + 1][y + 1] +
mine[x][y + 1] +
mine[x - 1][y + 1] - 8 * '0');
}
//排雷
void find_mine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col)
{
int x = 0;
int y = 0;
int win = 0;
while (win <(col * row) - EASY_COUNT)
{
printf("请输入坐标》:");
scanf_s("%d %d",&x,&y);
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
if (show[x][y] == '*')
{
if (mine[x][y] == '0')
{
int count = get_mine_count(mine, x, y);
show[x][y] = count + '0';
display_board(show, ROW, COL);
win++;
}
else
{
printf("爆炸了\n");
display_board(mine, ROW, COL);
break;
}
}
else
{
printf("该坐标已被占用\n");
}
}
else
{
printf("输入坐标有误,请重新输入\n");
}
}
if (win == row * col - EASY_COUNT)
{
printf("恭喜你,排雷成功\n");
display_board(mine, ROW, COL);
}
}
#####################################################################
game.h
#include<stdio.h>
#pragma once
#include<stdlib.h>
#include<time.h>
#define ROW 9
#define COL 9
#define ROWS ROW+2
#define COLS COL+2
#define EASY_COUNT 10//雷的个数
extern void init_board(char mine[ROWS][COLS], int rows, int cols,char set);
extern void display_board(char board[ROWS][COLS], int row, int col);
extern void set_mine(char mine[ROWS][COLS], int row, int col);
extern void find_mine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col);
###############################################################
游戏演示

############################################
############################################
############################################
############################################
############################################
############################################
############################################
最后:文章有什么不对的地方或者有什么更好的写法欢迎大家在评论区指出来.
边栏推荐
- Unity Tutorial: URP Rendering Pipeline Practical Tutorial Series [1]
- XSS靶场(三)prompt to win
- 产学研用 共建开源人才生态 | 2022开放原子全球开源峰会教育分论坛圆满召开
- 关于出现大量close_wait状态的理解
- ERP Production Operation Control Kingdee
- MySQL忘记密码怎么办
- DVWA安装教程(懂你的不懂·详细)
- ENSP,划分VLAN、静态路由,三层交换机综合配置
- mysql基础知识(二)
- 【debug锦集】Expected input batch_size (1) to match target batch_size (0)
猜你喜欢

C语言表白代码?

Fusion Cloud Native, Empowering New Milestones | 2022 Open Atom Global Open Source Summit Cloud Native Sub-Forum Successfully Held

MySQL数据库必会的增删查改操作(CRUD)

MySQL database installation (detailed)

重磅 | 开放原子校源行活动正式启动

idea工程明明有依赖但是文件就是显示没有,Cannot resolve symbol ‘XXX‘
![[Linear Neural Network] softmax regression](/img/98/ffdff5e96ad0d6ac0142af7ca11e9a.png)
[Linear Neural Network] softmax regression

Puzzle Game Level Design: Reverse Method--Explaining Puzzle Game Level Design

Create componentized development based on ILRuntime hot update

益智类游戏关卡设计:逆推法--巧解益智类游戏关卡设计
随机推荐
Lua,ILRuntime, HybridCLR(wolong)/huatuo hot update comparative analysis
Two address pools r2 are responsible for managing the address pool r1 is responsible for managing dhcp relays
SOLVED: After accidentally uninstalling pip (two ways to manually install pip)
Doris学习笔记之监控
Unity URP渲染管线摄像机核心机制剖析
MySQL忘记密码怎么办
Musk talks to the "virtual version" of Musk, how far is the brain-computer interaction technology from us
MATLAB/Simulink & & STM32CubeMX tool chain completes model-based design development (MBD) (three)
ERP Production Operation Control Kingdee
MySQL数据库备份
Open Source Database Innovation in the Digital Economy Era | 2022 Open Atom Global Open Source Summit Database Sub-Forum Successfully Held
MySQL数据库安装配置保姆级教程(以8.0.29为例)有手就行
unity2d game
MySQL数据库增删改查(基础操作命令详解)
【debug锦集】Expected input batch_size (1) to match target batch_size (0)
mysql数据库安装(详细)
【线性神经网络】softmax回归
[Linear Neural Network] softmax regression
Vue项目通过node连接MySQL数据库并实现增删改查操作
mysql基础知识(二)