C++ 在C中包装两个数组

我正在开发一个棋类游戏Oware的C-rereation游戏项目，我需要两个数组来相互包装.

我有一个用于游戏的 struct 和几个全局变量，以及每个玩家的一个数组，该数组由 struct 中的全局变量定义，这使得每个玩家有六个坑可以玩.

#include <stdio.h>
#define num_players 2
#define num_pits_player 6
#define num_seeds 4

struct gameState{
    int pits[num_players][num_pits_player]; //pits for the seeds
    int deposit[num_players]; //deposit for the pits
    int playerTurn; //keeping track of whose turn it is
};

void displayGame(struct gameState *game){
    printf("\n");
    printf("|--------|--|--player1--|--|--------|\n"
           "|score_p1|%2d|%2d|%2d|%2d|%2d|%2d|score_p0|\n"
           "|  %2d    |-----------------|   %2d   |\n"
           "|        |%2d|%2d|%2d|%2d|%2d|%2d|        |\n"
           "|--------|--|--player0--|--|--------|\n",
           game->pits[1][0], game->pits[1][1], game->pits[1][2], game->pits[1][3], game->pits[1][4], game->pits[1][5],
           game->deposit[1], game->deposit[0],
           game->pits[0][0], game->pits[0][1], game->pits[0][2], game->pits[0][3], game->pits[0][4], game->pits[0][5]);
}

void makeMove(struct gameState *game){
    int player = game->playerTurn;
    int pitToSow;

    printf("Player %d's turn.\nPick a pit to sow(1-6): ", player);
    scanf("%d", &pitToSow);
    pitToSow--; // adjusting for zero-based indexing

    // Get the seeds from the selected pit
    int seedsToSow = game->pits[player][pitToSow];

    // Clear the selected pit
    game->pits[player][pitToSow] = 0;

    // Distribute seeds in a counterclockwise direction
    int currentPit = (pitToSow + 1) % num_pits_player;

    while (seedsToSow > 0) {
        // Distribute one seed to the current pit
        game->pits[player][currentPit]++;
        seedsToSow--;

        // Move to the next pit
        currentPit = (currentPit + 1);

    }
}

我面临的错误是，每当代码运行时，我都会收到

|--------|--|--player1--|--|--------| /*initial print*/
|score_p1| 4| 4| 4| 4| 4| 4|score_p0| 
|   0    |-----------------|    0   |
|        | 4| 4| 4| 4| 4| 4|        |
|--------|--|--player0--|--|--------|

Player 0's turn.
Pick a pit to sow(1-6):4
|--------|--|--player1--|--|--------| /*player 0's play*/
|score_p1| 5| 5| 4| 4| 4| 4|score_p0| /*works as expected*/
|   0    |-----------------|    0   |
|        | 4| 4| 4| 0| 5| 5|        |
|--------|--|--player0--|--|--------|
Player 1's turn.
Pick a pit to sow(1-6):5

|--------|--|--player1--|--|--------| /*player 1's play, the error seems to be*/
|score_p1| 5| 5| 4| 4| 0| 5|score_p0| /*that it doesnt wrap through */
|   1    |-----------------|    1   | /*to player 0's pits when finished with its own*/
|        | 4| 4| 4| 0| 5| 5|        | 
|--------|--|--player0--|--|--------| 

而不是理想

|--------|--|--player1--|--|--------| /*initial print*/
|score_p1| 4| 4| 4| 4| 4| 4|score_p0| 
|   0    |-----------------|    0   |
|        | 4| 4| 4| 4| 4| 4|        |
|--------|--|--player0--|--|--------|

Player 0's turn.
Pick a pit to sow(1-6):4
|--------|--|--player1--|--|--------| /*player 0's play*/
|score_p1| 5| 5| 4| 4| 4| 4|score_p0| /*works as expected*/
|   0    |-----------------|    0   |
|        | 4| 4| 4| 0| 5| 5|        |
|--------|--|--player0--|--|--------|
Player 1's turn.
Pick a pit to sow(1-6):5

|--------|--|--player1--|--|--------| /*optimal player 1 play,wrapping to player 0's pits when finished with its own*/
|score_p1| 5| 5| 4| 4| 0| 5|score_p0| 
|   1    |-----------------|    1   | 
|        | 5| 5| 5| 0| 5| 5|        | 
|--------|--|--player0--|--|--------|