【简单的C++围棋游戏开发示例】

news2025/3/9 13:49:01

C++围棋游戏开发简单示例（控制台版）

‌核心代码实现‌


#include <iostream>
#include <vector>
#include <queue>
using namespace std;

const int SIZE = 9;  // 简化棋盘为9x9‌:ml-citation{ref="1" data="citationList"}
int board[SIZE][SIZE] = {0};  // 0:空 1:黑 2:白‌:ml-citation{ref="1,2" data="citationList"}
pair<int, int> lastRemoved = {-1, -1};  // 记录上一步提子位置（简化打劫规则）‌:ml-citation{ref="1" data="citationList"}

// 显示棋盘
void displayBoard() {
    cout << "  ";
    for (int i = 0; i < SIZE; i++) cout << i << " ";
    cout << "\n";
    for (int y = 0; y < SIZE; y++) {
        cout << y << " ";
        for (int x = 0; x < SIZE; x++) {
            char c = (board[y][x] == 1) ? 'B' : (board[y][x] == 2) ? 'W' : '+';
            cout << c << " ";
        }
        cout << "\n";
    }
}

// 检查坐标合法性
bool isValid(int x, int y) {
    return x >= 0 && x < SIZE && y >= 0 && y < SIZE;
}

// BFS计算气（Liberty）
int calculateLiberty(int x, int y, int color) {
    bool visited[SIZE][SIZE] = {false};
    queue<pair<int, int>> q;
    q.push({x, y});
    visited[y][x] = true;
    int liberty = 0;

    vector<pair<int, int>> dirs = {{0,1}, {1,0}, {0,-1}, {-1,0}};
    while (!q.empty()) {
        auto [cx, cy] = q.front();
        q.pop();

        for (auto [dx, dy] : dirs) {
            int nx = cx + dx, ny = cy + dy;
            if (!isValid(nx, ny) || visited[ny][nx]) continue;
            if (board[ny][nx] == 0) liberty++;
            else if (board[ny][nx] == color) {
                visited[ny][nx] = true;
                q.push({nx, ny});
            }
        }
    }
    return liberty;
}

// 提子逻辑
void removeGroup(int x, int y, int color) {
    queue<pair<int, int>> q;
    q.push({x, y});
    board[y][x] = 0;

    vector<pair<int, int>> dirs = {{0,1}, {1,0}, {0,-1}, {-1,0}};
    while (!q.empty()) {
        auto [cx, cy] = q.front();
        q.pop();

        for (auto [dx, dy] : dirs) {
            int nx = cx + dx, ny = cy + dy;
            if (isValid(nx, ny) && board[ny][nx] == color) {
                board[ny][nx] = 0;
                q.push({nx, ny});
            }
        }
    }
}

// 落子逻辑
bool placeStone(int x, int y, int color) {
    if (!isValid(x, y) || board[y][x] != 0) return false;

    board[y][x] = color;
    vector<pair<int, int>> dirs = {{0,1}, {1,0}, {0,-1}, {-1,0}};

    // 检查周围敌方棋子是否无气
    for (auto [dx, dy] : dirs) {
        int nx = x + dx, ny = y + dy;
        if (isValid(nx, ny) && board[ny][nx] != 0 && board[ny][nx] != color) {
            if (calculateLiberty(nx, ny, board[ny][nx]) == 0) {
                removeGroup(nx, ny, board[ny][nx]);
                lastRemoved = {x, y};  // 记录提子位置‌:ml-citation{ref="1" data="citationList"}
            }
        }
    }

    // 检查自身棋子是否存活
    if (calculateLiberty(x, y, color) == 0) {
        board[y][x] = 0;  // 自杀规则
        return false;
    }
    return true;
}

int main() {
    int currentPlayer = 1;  // 黑方先手
    while (true) {
        displayBoard();
        int x, y;
        cout << "玩家" << ((currentPlayer == 1) ? "黑(B)" : "白(W)") << "输入坐标(x y): ";
        cin >> x >> y;

        if (placeStone(x, y, currentPlayer)) {
            currentPlayer = (currentPlayer == 1) ? 2 : 1;  // 切换玩家‌:ml-citation{ref="3" data="citationList"}
        } else {
            cout << "落子无效，请重新输入！\n";
        }
    }
    return 0;
}