c语言五子棋功能模块代码与实现原理

五子棋是一种双人对弈游戏，通过在棋盘上落子来争夺胜利。下面是一个简单的 C 语言实现五子棋游戏的示例代码。

c语言五子棋功能模块代码实现：

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

#define BOARD_SIZE 15

enum chess_type {EMPTY, BLACK, WHITE};
// 定义枚举类型，表示棋子的种类：空、黑、白

enum game_state {PLAYING, BLACK_WIN, WHITE_WIN, DRAW};
// 定义枚举类型，表示游戏的状态：进行中、黑方胜利、白方胜利、平局

struct chessboard {
    enum chess_type board[BOARD_SIZE][BOARD_SIZE];
    // 存储棋盘上每个位置的棋子种类
    int current_player; // 当前玩家（BLACK 或 WHITE）
    int moves; // 记录已下棋子的数量
};

// 初始化棋盘
void init_chessboard(struct chessboard* cb) {
    int i, j;
    for (i = 0; i < BOARD_SIZE; i++) {
        for (j = 0; j < BOARD_SIZE; j++) {
            cb->board[i][j] = EMPTY;
        }
    }
    cb->current_player = BLACK;
    cb->moves = 0;
}

// 打印棋盘
void print_chessboard(struct chessboard* cb) {
    int i, j;
    printf("  ");
    for (i = 0; i < BOARD_SIZE; i++) {
        printf("%2d ", i);
    }
    printf("\n");
    for (i = 0; i < BOARD_SIZE; i++) {
        printf("%2d ", i);
        for (j = 0; j < BOARD_SIZE; j++) {
            switch (cb->board[i][j]) {
                case EMPTY:
                    printf(".  ");
                    break;
                case BLACK:
                    printf("X  ");
                    break;
                case WHITE:
                    printf("O  ");
                    break;
            }
        }
        printf("\n");
    }
}

// 判断是否已有五子连珠
int check_win(struct chessboard* cb, int x, int y) {
    int i, j, count;
    enum chess_type current_chess = cb->board[x][y];
    // 水平方向
    count = 1;
    for (i = x + 1; i < BOARD_SIZE && cb->board[i][y] == current_chess; i++) {
        count++;
    }
    for (i = x - 1; i >= 0 && cb->board[i][y] == current_chess; i--) {
        count++;
    }
    if (count >= 5) {
        return 1;
    }
    // 垂直方向
    count = 1;
    for (j = y + 1; j < BOARD_SIZE && cb->board[x][j] == current_chess; j++) {
        count++;
    }
    for (j = y - 1; j >= 0 && cb->board[x][j] == current_chess; j--) {
        count++;
    }
    if (count >= 5) {
        return 1;
    }
    // 左斜方向
    count = 1;
    for (i =x + 1, j = y + 1; i < BOARD_SIZE && j < BOARD_SIZE && cb->board[i][j] == current_chess; i++, j++) {
count++;
}
for (i = x - 1, j = y - 1; i >= 0 && j >= 0 && cb->board[i][j] == current_chess; i--, j--) {
count++;
}
if (count >= 5) {
return 1;
}
// 右斜方向
count = 1;
for (i = x + 1, j = y - 1; i < BOARD_SIZE && j >= 0 && cb->board[i][j] == current_chess; i++, j--) {
count++;
}
for (i = x - 1, j = y + 1; i >= 0 && j < BOARD_SIZE && cb->board[i][j] == current_chess; i--, j++) {
count++;
}
if (count >= 5) {
return 1;
}
return 0;
}

// 落子操作
int place_chess(struct chessboard* cb, int x, int y) {
if (cb->board[x][y] != EMPTY) {
printf("该位置已有棋子！\n");
return 0;
}
cb->board[x][y] = cb->current_player;
cb->moves++;
if (check_win(cb, x, y)) {
return 1; // 胜利
}
if (cb->moves == BOARD_SIZE * BOARD_SIZE) {
return 2; // 平局
}
cb->current_player = (cb->current_player == BLACK ? WHITE : BLACK);
return 0; // 继续游戏
}

// 主函数
int main() {
struct chessboard cb;
init_chessboard(&cb);
int x, y, result;
while (1) {
printf("%s方落子（格式：行 列，如“3 4”）：", cb.current_player == BLACK ? "黑" : "白");
scanf("%d%d", &x, &y);
result = place_chess(&cb, x, y);
if (result == 1) {
printf("%s方胜利！\n", cb.current_player == BLACK ? "白" : "黑");
break;
} else if (result == 2) {
printf("平局！\n");
break;
}
print_chessboard(&cb);
}
return 0;
}