当前位置:网站首页>扫雷游戏(c语言写)
扫雷游戏(c语言写)
2022-07-31 03:46:00 【不能在白了呀】
扫雷游戏分为三个板块分别是:
* test.c (主函数)
* game.c(游戏部分代码实现)
* game.h(头文件,宏定义,函数的声明)
test.c
#include"game.h"
void menu()
{
//打印扫雷游戏目录
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);
//存放地雷
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--;
}
}
}
//数在你所输入的坐标一圈有几个雷
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);
###############################################################
游戏演示
############################################
############################################
############################################
############################################
############################################
############################################
############################################
最后:文章有什么不对的地方或者有什么更好的写法欢迎大家在评论区指出来。
边栏推荐
- type_traits metaprogramming library learning
- Detailed explanation of TCP (2)
- 识Flutter 基本组件之showTimePicker 方法
- [C language] General method for finding the sum of the greatest common factor and the least common multiple of two integers m and n, the classical solution
- Good place to download jar packages
- Why don't you programmers make a living off your own projects?And have to work for someone else?
- What skills do I need to learn to move from manual testing to automated testing?
- Daily practice of LeetCode - 138. Copy a linked list with random pointers
- (五)final、抽象类、接口、内部类
- [Godot][GDScript] 2D cave map randomly generated
猜你喜欢
type_traits元编程库学习
Zotero如何删除自动生成的标签
[C language] General method for finding the sum of the greatest common factor and the least common multiple of two integers m and n, the classical solution
BP神经网络
从滴滴罚款后数据治理思考
Just debuted "Fight to Fame", safety and comfort are not lost
端口排查步骤-7680端口分析-Dosvc服务
安全20220712
「 每日一练,快乐水题 」1331. 数组序号转换
SIP协议标准和实现机制
随机推荐
浅识Flutter 基本组件之showDatePicker方法
$parent/$children 与 ref
C language from entry to such as soil, the data store
errno error code and meaning (Chinese)
Observer pattern
(6) Enumeration and annotation
(八)Math 类、Arrays 类、System类、Biglnteger 和 BigDecimal 类、日期类
SocialFi 何以成就 Web3 去中心化社交未来
(树) 最近公共祖先(LCA)
els 方块向右移动边界判断、向下加速
ClickHouse: Setting up remote connections
Distributed locks and three implementation methods
Daily practice of LeetCode - palindrome structure of OR36 linked list
A brief introduction to the CheckBox component of the basic components of Flutter
RESTful api interface design specification
$parent/$children and ref
BP神经网络
组件传值 provide/inject
【小土堆补充】Pytorch学习笔记_Anaconda虚拟环境使用
数据库文件中的未分配的块和未使用的块的区别