c语言实战-极简扫雷

C语言/c++写的C语言实战项目扫雷

结构比较清晰,仅供参考:

核心是扫雷的递归算法实现

上代码:

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

#define SIZE 10
#define MINES 15

char board[SIZE][SIZE]; // 游戏棋盘

// 初始化棋盘,'-'表示未揭示的区域
void initBoard() {
    for (int i = 0; i < SIZE; ++i) {
        for (int j = 0; j < SIZE; ++j) {
            board[i][j] = '-';
        }
    }
}

// 在棋盘上显示当前状态
void displayBoard() {
    printf("   ");
    for (int i = 0; i < SIZE; ++i) {
        printf("%d ", i);
    }
    printf("\n");
    for (int i = 0; i < SIZE; ++i) {
        printf("%d  ", i);
        for (int j = 0; j < SIZE; ++j) {
            printf("%c ", board[i][j]);
        }
        printf("\n");
    }
}

// 随机布置地雷
void placeMines() {
    srand(time(NULL));
    int count = 0;
    while (count < MINES) {
        int x = rand() % SIZE;
        int y = rand() % SIZE;
        if (board[x][y] != '*') {
            board[x][y] = '*';
            count++;
        }
    }
}

// 检查坐标是否有效
int isValid(int x, int y) {
    return (x >= 0 && x < SIZE && y >= 0 && y < SIZE);
}

// 计算周围的地雷数量
int countAdjacentMines(int x, int y) {
    int count = 0;
    for (int i = x - 1; i <= x + 1; ++i) {
        for (int j = y - 1; j <= y + 1; ++j) {
            if (isValid(i, j) && board[i][j] == '*') {
                count++;
            }
        }
    }
    return count;
}

// 揭示某个位置的内容
void reveal(int x, int y) {
    if (!isValid(x, y)) {
        return;
    }
    if (board[x][y] != '-') {
        return;
    }
    int mines = countAdjacentMines(x, y);
    if (mines > 0) {
        board[x][y] = mines + '0';
    } else {
        board[x][y] = ' ';
        for (int i = x - 1; i <= x + 1; ++i) {
            for (int j = y - 1; j <= y + 1; ++j) {
                reveal(i, j);
            }
        }
    }
}

int main() {
    int x, y;
    char action;

    initBoard();
    placeMines();

    do {
        displayBoard();
        printf("Enter action (r for reveal, q to quit): ");
        scanf(" %c", &action);

        if (action == 'r') {
            printf("Enter coordinates (x y): ");
            scanf("%d %d", &x, &y);
            if (isValid(x, y)) {
                reveal(x, y);
            } else {
                printf("Invalid coordinates!\n");
            }
        } else if (action == 'q') {
            printf("Quitting game.\n");
            break;
        } else {
            printf("Invalid action!\n");
        }
    } while (1);

    return 0;
}

相关推荐

  1. c语言实战-扫雷

    2024-07-10 20:54:04       31 阅读
  2. 《工厂模式(c++)》

    2024-07-10 20:54:04       45 阅读
  3. 《原型模式(c++)》

    2024-07-10 20:54:04       58 阅读

最近更新

  1. docker php8.1+nginx base 镜像 dockerfile 配置

    2024-07-10 20:54:04       100 阅读
  2. Could not load dynamic library ‘cudart64_100.dll‘

    2024-07-10 20:54:04       107 阅读
  3. 在Django里面运行非项目文件

    2024-07-10 20:54:04       90 阅读
  4. Python语言-面向对象

    2024-07-10 20:54:04       98 阅读

热门阅读

  1. 从零到一:构建股票预测模型的Python实战教程

    2024-07-10 20:54:04       26 阅读
  2. SpringBoot | 面试题

    2024-07-10 20:54:04       28 阅读
  3. Shell学习——Shell printf命令

    2024-07-10 20:54:04       26 阅读
  4. Linux实现CPU物理隔离

    2024-07-10 20:54:04       25 阅读
  5. Redis 中的跳表(Skip List)

    2024-07-10 20:54:04       30 阅读
  6. 路由器是什么?

    2024-07-10 20:54:04       26 阅读
  7. redis实现延时队列

    2024-07-10 20:54:04       28 阅读
  8. Shell选择结构

    2024-07-10 20:54:04       32 阅读
  9. Poincaré图和SD2计算参考

    2024-07-10 20:54:04       27 阅读