当前位置:网站首页>Minesweeper game - C language
Minesweeper game - C language
2022-07-31 04:29:00 【Luo hand bugs @】
目录
一、游戏规则:
二、运行逻辑:
三、基本步骤:
2、Design two arrays to store information:
6、Demining and judging whether the demining has been completed:
四、总代码:
一、游戏规则:
Minesweeper game is to find all non-mine squares according to the numbers that appear on the clicked squares,同时避免踩雷,Step on a thunder and fail.
二、运行逻辑:
1、Create and print game menus.
2、创建两个棋盘数组,One is a checkerboard array where mines are placed,One is a checkerboard array to check mine.
3、初始化两个棋盘,Initialize all the chessboards on which the mines are arranged' 0 ' ,Initialize all checkerboards to ' * ' .
4、打印棋盘.
5、布置雷,The number of mines can be set by macro definition in the header file.
6、排查雷,Check in the array of laying mines,If it was mine, the print was killed,并退出游戏.如果不是雷,则统计雷的个数,是0then expand blank,不是0Then pass the number of mines to the array that checks mines.
7、判断输赢,If the total number of spaces is the product of rows and columns minus the number of Brays,则表示排雷成功.
三、基本步骤:
1、显示菜单界面:
void menu()
{
printf("************ 1. play **********\n");
printf("************ 0. exit **********\n");
}
2、Design two arrays to store information:
char mine[ROWS][COLS] = { 0 };
char show[ROWS][COLS] = { 0 };
3、初始化棋盘:
void init_board(char board[ROWS][COLS], int rows, int cols, char set)
{
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
board[i][j] = set;
}
}
}
4、布置雷:
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--;
}
}
}
5、打印棋盘:
void display_board(char board[ROWS][COLS], int row, int col)
{
//列号
for (int j = 0; j <= col; j++)
{
printf("%d ", j);
}
printf("\n");
for (int i = 1; i <= row; i++)
{
printf("%d ", i);
for (int j = 1; j <= col; j++)
{
printf("%c ", board[i][j]);
}
printf("\n");
}
}
6、Demining and judging whether the demining has been completed:
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 < row * col - EASY_COUNT)
{
printf("请输入要排查雷的坐标:");
scanf("%d %d", &x, &y);
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
//Coordinates are checked
if (show[x][y] == '*')
{
if (mine[x][y] == '1')
{
printf("很遗憾,你被炸死了\n");
display_board(mine, ROW, COL);
break;
}
else
{
int count = get_mine_count(mine, x, y);
show[x][y] = count + '0';
display_board(show, ROW, COL);
win++;
}
}
else
{
printf("该坐标已经被排查过了\n");
}
}
else
{
printf("该坐标已经被排查过了\n");
}
}
if (win == row * col - EASY_COUNT)
{
printf("恭喜你,排雷成功\n");
display_board(mine, ROW, COL);
}
}
四、总代码:
Implemented using multiple files,一个头文件game.h,两个源文件game.c和test.c.
1、game.h:
#pragma once
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define ROW 9
#define COL 9
#define ROWS ROW+2
#define COLS COL+2
#define EASY_COUNT 30
//初始化棋盘
void init_board(char board[ROWS][COLS], int rows, int cols, char set);
//打印棋盘
void display_board(char board[ROWS][COLS], int row, int col);
//布置雷
void set_mine(char mine[ROWS][COLS], int row, int col);
//排查雷
void find_mine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col);
2、game.c:
#include"game.h"
//初始化棋盘
void init_board(char board[ROWS][COLS], int rows, int cols, char set)
{
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
board[i][j] = set;
}
}
}
//打印棋盘
void display_board(char board[ROWS][COLS], int row, int col)
{
//列号
for (int j = 0; j <= col; j++)
{
printf("%d ", j);
}
printf("\n");
for (int i = 1; i <= row; i++)
{
printf("%d ", i);
for (int 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--;
}
}
}
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 < row * col - EASY_COUNT)
{
printf("请输入要排查雷的坐标:");
scanf("%d %d", &x, &y);
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
//Coordinates are checked
if (show[x][y] == '*')
{
if (mine[x][y] == '1')
{
printf("很遗憾,你被炸死了\n");
display_board(mine, ROW, COL);
break;
}
else
{
int count = get_mine_count(mine, x, y);
show[x][y] = count + '0';
display_board(show, ROW, COL);
win++;
}
}
else
{
printf("该坐标已经被排查过了\n");
}
}
else
{
printf("该坐标已经被排查过了\n");
}
}
if (win == row * col - EASY_COUNT)
{
printf("恭喜你,排雷成功\n");
display_board(mine, ROW, COL);
}
}
3、test.c:
#include"game.h"
void menu()
{
printf("************ 1. play **********\n");
printf("************ 0. exit **********\n");
}
void game()
{
//设计2An array to store information
char mine[ROWS][COLS] = { 0 };
char show[ROWS][COLS] = { 0 };
//初始化棋盘
//mine初始化为全‘0’
//show初始化为全‘*’
init_board(mine, ROWS, COLS, '0');
init_board(show, ROWS, COLS, '*');
//布置雷
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("请选择:\n");
scanf("%d", &input);
switch (input)
{
case 1:
game();
break;
case 0:
printf("退出游戏\n");
break;
default:
printf("选择错误,重新选择\n");
break;
}
} while (input);
return 0;
}
边栏推荐
- 【wpf】wpf中的那些模板之深度解析
- Daily practice of LeetCode - 138. Copy a linked list with random pointers
- IDEA常用快捷键与插件
- 慧通编程第4关 - 魔法学院第6课
- Safety 20220718
- 简易网络文件拷贝的C实现
- 高斯分布及其极大似然估计
- VScode+ESP32 quickly install ESP-IDF plugin
- Redis uses sorted set to cache latest comments
- Summary of Huawei Distributed Storage FusionStorage Knowledge Points [Interview]
猜你喜欢
行业落地呈现新进展 | 2022开放原子全球开源峰会OpenAtom OpenHarmony分论坛圆满召开
【线性神经网络】softmax回归
VScode+ESP32快速安装ESP-IDF插件
(八)Math 类、Arrays 类、System类、Biglnteger 和 BigDecimal 类、日期类
手把手实现图片预览插件(三)
Hand in hand to realize the picture preview plug-in (3)
type_traits元编程库学习
HCIP Day 10_BGP Route Summary Experiment
IDEA常用快捷键与插件
MySQL based operations
随机推荐
MATLAB/Simulink & & STM32CubeMX tool chain completes model-based design development (MBD) (three)
Gaussian distribution and its maximum likelihood estimation
Redis uses LIST to cache the latest comments
IDEA common shortcut keys and plug-ins
type_traits metaprogramming library learning
端口排查步骤-7680端口分析-Dosvc服务
$attrs/$listeners
Bubble sort, selection sort, insertion sort, binary search directly
ENSP,划分VLAN、静态路由,三层交换机综合配置
HCIP第十天_BGP路由汇总实验
重磅 | 开放原子校源行活动正式启动
mysql数据库安装(详细)
高斯分布及其极大似然估计
[C language] General method of base conversion
【小土堆补充】Pytorch学习笔记_Anaconda虚拟环境使用
qlib架构
问题7:列表的拼接
Why don't you programmers make a living off your own projects?And have to work for someone else?
Exsl file preview, word file preview web page method
Pytest e-commerce project combat (on)