扫雷_srand 扫雷逆向-CSDN博客

本文链接：https://blog.csdn.net/qq_35452533/article/details/70847655

game.h

#ifndef __GAME_H__
#define __GAME_H__

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>

#define ROWS 11
#define COLS 11

#define ROW (ROWS-2)
#define COL (COLS-2)		

#define MAX 10

//void game();//设计逻辑流程(可不加)
void menu();//输入提示
void mine_fun(int intput);//游戏开始选择
void set_mine(char mine[ROWS][COLS]);//棋盘布雷
void display_board(char arr[ROWS][COLS]);//打印自定义棋盘
int player(char show[ROWS][COLS], char mine[ROWS][COLS], int *step);//玩家输入
void check(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step);//检测周围的雷数并显示在棋盘show对应点上
void optimize(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step);//优化函数

#endif//__GAME_H__

game.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "game.h"

void game()
{
	int ret = 0;
	char mine[ROWS][COLS] = {0};
	char show[ROWS][COLS] = {0};
	int step = ROW*COL - MAX;//要点亮的棋盘块数(不被炸死的情况下，就是需要走的不数)
	memset(mine, '0', ROWS*COLS*sizeof(mine[0][0]));//初始化mine棋盘
	memset(show, '*', ROWS*COLS*sizeof(show[0][0]));//初始化show棋盘
	set_mine(mine);
	//display_board(mine);
	display_board(show);
	ret = player(show, mine, &step);
	if(ret == 1)
	{
		printf("扫雷成功\n");
		printf("布雷棋盘为：\n");
		display_board(mine);
	}
	else
	{
		printf("你被炸死了\n");
		printf("布雷棋盘为：\n");
		display_board(mine);
	}
}

void menu()
{
	printf("###开始游戏.：1   退出系统：0###");
}

enum Option
{
	EXIT,PLAY
};

void mine_fun(int input)
{
	switch(input)
	{
	case PLAY:
		game();
		break;
	case EXIT:
		break;
	default:
		printf("输入错误");
		break;
	}
}

void set_mine(char mine[ROWS][COLS])
{
	int num = MAX;
	srand((unsigned)time(NULL));

	while(num)
	{
		int i = rand() % ROW + 1;
		int j = rand() % COL + 1;
		if(mine[i][j] == '0')
		{
			mine[i][j] = '1';
			num--;
		}
	}
}

void display_board(char arr[ROWS][COLS])
{
	int i;
	int j;

	printf("  ");
	for(i=1; i<=COL; i++)
	{
		printf("%d ",i);
	}
	printf("\n");

	for(i=1; i<=ROW; i++)
	{
		printf("%d ",i);
		for(j=1; j<=COL; j++)
		{
			printf("%c ",arr[i][j]);
		}
		printf("\n");
	}
}

void check(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	show[i][j] = (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] - 7*'0');
	(*step)--;
}

void judge(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	if(((i-1>0)&&(i-1<ROWS-1))&&((j-1>0)&&(j-1<ROWS-1))&&(show[i-1][j-1] == '*'))
		check(mine ,show, i-1, j-1, step);
	if(((i-1>0)&&(i-1<ROWS-1))&&((j>0)&&(j<ROWS-1))&&(show[i-1][j] == '*'))
		check(mine ,show, i-1, j, step);
	if(((i-1>0)&&(i-1<ROWS-1))&&((j+1>0)&&(j+1<ROWS-1))&&(show[i-1][j+1] == '*'))
		check(mine ,show, i-1, j+1, step);
	if(((i>0)&&(i<ROWS-1))&&((j-1>0)&&(j-1<ROWS-1))&&(show[i][j-1] == '*'))
		check(mine ,show, i, j-1, step);
	if(((i>0)&&(i<ROWS-1))&&((j+1>0)&&(j+1<ROWS-1))&&(show[i][j+1] == '*'))
		check(mine ,show, i, j+1, step);
	if(((i+1>0)&&(i+1<ROWS-1))&&((j-1>0)&&(j-1<ROWS-1))&&(show[i+1][j-1] == '*'))
		check(mine ,show, i+1, j-1, step);
	if(((i+1>0)&&(i+1<ROWS-1))&&((j>0)&&(j<ROWS-1))&&(show[i+1][j] == '*'))
		check(mine ,show, i+1, j, step);
	if(((i+1>0)&&(i+1<ROWS-1))&&((j+1>0)&&(j+1<ROWS-1))&&(show[i+1][j+1] == '*'))
		check(mine ,show, i+1, j+1, step);
}

void optimize_up(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	int up_i = 0;
	int up_j = 0;
	judge(mine, show, i, j, step);

	if((show[i-1][j] == '0'))
	{
		up_i = i-1;
		up_j = j;
		optimize_up(mine ,show, up_i, up_j, step);
	}
}

void optimize_left(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	int left_i = 0;
	int left_j = 0;
	judge(mine, show, i, j, step);

	if((show[i][j-1] == '0'))
	{
		left_i = i;
		left_j = j-1;
		optimize_left(mine ,show, left_i, left_j, step);
	}	
}

void optimize_right(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	int right_i = 0;
	int right_j = 0;
	judge(mine, show, i, j, step);
	
	if((show[i][j+1] == '0'))
	{
		right_i = i;
		right_j = j+1;
		optimize_right(mine ,show, right_i, right_j, step);
	}	
}

void optimize_down(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	int down_i = 0;
	int down_j = 0;
	judge(mine, show, i, j, step);
	
	if((show[i+1][j] == '0'))
	{
		down_i = i+1;
		down_j = j;
		optimize_down(mine ,show, down_i, down_j, step);
	}
}

void optimize(char mine[ROWS][COLS], char show[ROWS][COLS], int i, int j, int *step)
{
	optimize_up(mine, show, i, j, step);
	optimize_left(mine, show, i, j, step);
	optimize_right(mine, show, i, j, step);
	optimize_down(mine, show, i, j, step);
}

int player(char show[ROWS][COLS], char mine[ROWS][COLS], int *step)
{
	while(*step>0)
	{
		int i = 0;
		int j = 0;

		printf("请输入坐标：");
		scanf("%d%d", &i, &j);
		if(((i>=1)&&(i<=9))&&((j>=1)&&(j<=9)))
		{
			if(mine[i][j] != '1')
			{
				check(mine ,show, i, j, step);
				
				if(show[i][j] == '0')
				{
					optimize(mine ,show, i, j, step);
				}
				display_board(show);
			}
			else if((mine[i][j] == '1') && (*step == (ROW*COL - MAX)))//第一步踩到雷时不会被炸死
			{
				int x = rand() % ROW + 1;
				int y = rand() % COL + 1;
				mine[i][j] = '0';
				while(mine[x][y] != '0')
				{
					x = rand() % ROW + 1;
					y = rand() % COL + 1;
				}
				mine[x][y] = '1';
				check(mine ,show, i, j, step);
				if(show[i][j] == '0')
				{
					optimize(mine ,show, i, j, step);
				}
				display_board(show);
			}
			else
			{
				return -1;
			}
		}
		else
		{
			printf("输入错误，重新输入\n");
		}
	}
	return 1;
}

test.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "game.h"

int main()
{
	int input = 0;		
	menu();
	printf("请输入：");
	scanf("%d",&input);
	mine_fun(input);

    return 0;
}