快捷導(dǎo)航

C語(yǔ)言實(shí)現(xiàn)掃雷游戲

更新時(shí)間：2019年12月25日 11:42:12 作者：z向前

這篇文章主要為大家詳細(xì)介紹了C語(yǔ)言實(shí)現(xiàn)掃雷游戲，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下

本文將介紹如何用C語(yǔ)言多文件編程實(shí)現(xiàn)掃雷
該示例掃雷程序可實(shí)現(xiàn)以下幾個(gè)功能:

自定義雷數(shù)
踩雷后會(huì)將所有雷顯示出來
地圖大小易修改

Mine_clearance.h

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>


#define ROW 11
#define COL 11
#define 踩雷 0
#define 玩家勝利 1

int g_number_mine = (ROW - 1)*(COL - 1); //雷的數(shù)量上限
char map[ROW][COL];  //玩家看到的地圖
char mine_map[ROW + 2][COL + 2]; //雷陣

void Init_map();  //初始化玩家看到的地圖
void Init_mine_map(int input_count); //初始化雷陣
void Print_map();  //打印地圖
void Print_mine_map();  //如果踩雷需要把雷陣打印出來
void Player_move(int row, int col); //提示玩家輸入坐標(biāo)開始游戲 1.合法性校驗(yàn)(是否越界)2.是否重復(fù)輸入,(已經(jīng)輸入過的)
int Judge_mine_end(int row, int col); //判斷是否踩雷
char Count_number_mine(int row, int col); //統(tǒng)計(jì)周圍八個(gè)方塊雷的個(gè)數(shù)
void Print_mine_number(int row, int col, int n);//將周圍八個(gè)方塊雷的數(shù)量顯示在當(dāng)前方塊上
int Judge_win(int input_count); //判斷是否獲勝

Mine_clearance.c

#include "Mine_clearance.h"

//初始化玩家看到的地圖
void Init_map()
{
 for (int row = 0; row <= ROW; ++row)
 {
 for (int col = 0; col <= COL; ++col)
 {
 map[row][col] = ' ';
 }
 }
}

//初始化雷陣
void Init_mine_map(int input_count)
{
 for (int row = 0; row < ROW; ++row)
 {
 for (int col = 0; col < COL; ++col)
 {
 mine_map[row][col] = ' ';
 }
 }
 srand((unsigned)time(NULL));
 for (int i = 0; i < input_count; ++i)
 {

 int row = rand() % (ROW - 1) + 1;
 int col = rand() % (COL - 1) + 1;
 while (1)
 {
 if (mine_map[row][col] == 'x' && row == (ROW - 1) && col == (COL - 1))
 {
 row = 1;
 col = 1;
 } else if (mine_map[row][col] == 'x' && (col == COL - 1))
 {
 row += 1;
 col = 1;
 } else if (mine_map[row][col] == 'x' && (col < COL - 1))
 {
 col++;
 } else
 {
 mine_map[row][col] = 'x';

 break;
 }
 }
 }
}

//打印地圖
void Print_map()
{
 for (int i = 1; i < ROW; ++i)
 {
 printf(" %d ", i);
 }
 printf("\n|");
 for (int j = 1; j < ROW; ++j)
 {
 printf("-----|");
 }
 printf("\n");
 int i = 1;
 for (int row = 1; row < ROW; ++row)
 {
 for (int col = 1; col < COL; ++col)
 {
 printf("| %c ", map[row][col]);
 }
 printf("|%d\n", i);
 for (int b = 1; b < ROW; ++b)
 {
 printf("|-----");
 }

 printf("|");
 printf("\n");
 i = i + 1;
 }
}

//如果踩雷需要把雷陣打印出來
void Print_mine_map()
{
 for (int i = 1; i < ROW; ++i)
 {
 printf(" %d ", i);
 }
 printf("\n|");
 for (int j = 1; j < ROW; ++j)
 {
 printf("-----|");
 }
 printf("\n");
 int i = 1;
 for (int row = 1; row < ROW; ++row)
 {
 for (int col = 1; col < COL; ++col)
 {
 printf("| %c ", mine_map[row][col]);
 }
 printf("|%d\n", i);
 for (int b = 1; b < ROW; ++b)
 {
 printf("|-----");
 }
 printf("|");
 printf("\n");
 i = i + 1;
 }
}

//提示玩家輸入坐標(biāo)開始游戲
// 1.合法性校驗(yàn)(是否越界
// 2.是否重復(fù)輸入,(已經(jīng)輸入過的)
void Player_move(int row, int col)
{

 if (row < 1 || row >= ROW || col < 1 || col >= COL)
 {
 printf("非法輸入!請(qǐng)重新輸入\n");
 } else if (map[row][col] == 'o')
 {
 printf("重復(fù)輸入無(wú)效,請(qǐng)重新輸入!\n");
 } else
 {
 map[row][col] = 'o';
 }
}

//判斷是否踩雷
int Judge_mine_end(int row, int col)
{
 if (map[row][col] == 'o'&&mine_map[row][col] == 'x')
 {
 return 踩雷;
 }
 return 1;
}

//統(tǒng)計(jì)周圍八個(gè)方塊雷的個(gè)數(shù)
char Count_number_mine(int row, int col)
{
 int n = 0;
 for (int i = -1; i < 2; ++i)
 {
 for (int j = -1; j < 2; ++j)
 {
 if (mine_map[row + i][col + j] == 'x')
 {
 n += 1;
 }
 }
 }
 return n;
}
//將周圍八個(gè)方塊雷的數(shù)量顯示在當(dāng)前方塊上
void Print_mine_number(int row, int col, int n)
{
 char num_mine[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8' };
 switch (n){
 case 0:
 map[row][col] = num_mine[0];
 break;
 case 1:
 map[row][col] = num_mine[1];
 break;
 case 2:
 map[row][col] = num_mine[2];
 break;
 case 3:
 map[row][col] = num_mine[3];
 break;
 case 4:
 map[row][col] = num_mine[4];
 break;
 case 5:
 map[row][col] = num_mine[5];
 break;
 case 6:
 map[row][col] = num_mine[6];
 break;
 case 7:
 map[row][col] = num_mine[7];
 break;
 case 8:
 map[row][col] = num_mine[8];
 break;
 default:
 printf("雷數(shù)非法\n");
 break;
 }
}

int Judge_win(int input_count)
{
 int num_mine = 0;
 for (int row = 1; row < ROW; ++row)
 {
 for (int col = 1; col < COL; ++col)
 {
 if (map[row][col] != ' ')
 {
 num_mine += 1;
 }
 }
 }
 if (num_mine == (ROW - 1)*(COL - 1) - input_count)
 {
 return 玩家勝利;
 }
 return 2;
}

main.c

#include "Mine_clearance.h"

int main()
{

 while (1)
 {
 int input_count = 0;
 int count_mine = 0;
 int row = 0;
 int col = 0;

 printf("自定義雷的個(gè)數(shù):\n");
 scanf("%d", &input_count);
 if (input_count < 1 || input_count >= g_number_mine)
 {
 printf("非法輸入,請(qǐng)重新輸入!\n");
 } else
 {
 Init_mine_map(input_count);
 Init_map();
 Print_map();

 while (1)
 {
 printf("請(qǐng)輸入坐標(biāo):(中間用空格隔開)\n");
 scanf("%d %d", &row, &col);
 Player_move(row, col);
 if (Judge_mine_end(row, col) == 踩雷)
 {
  printf("踩雷了,游戲結(jié)束\n");
  Print_mine_map();
  break;
 } else
 {
  count_mine = Count_number_mine(row, col);
  Print_mine_number(row, col, count_mine);
  Print_map();
  if (Judge_win(input_count) == 玩家勝利)
  {
  printf("你贏了!\n");
  break;
  }
 }
 }
 }
 }

 system("pause");
 return 0;

}

顯示效果：