2

我正在建造一个井字游戏解决机器人。为了练习,我使用极小极大算法编写了一个井字游戏,效果非常好。当我想将我的代码移植到控制器时,我发现这个控制器的 C/C++ 编译器都不支持递归函数。因此,我需要帮助将此递归 minimax 函数转换为使用迭代或内部堆栈的函数:

int miniMax (char board[BOARD_DIM][BOARD_DIM], _Bool minNode, int *xBest, int *yBest)
{
    int possibleMoves[NSQUARES][2];
    int nPossibleMoves = generateMoves(board, possibleMoves);
    char boardChild [BOARD_DIM][BOARD_DIM];
    int ind, x_ind, y_ind;
    int minScore, maxScore;
    if (gameOver(board))
        return evaluateState(board);
    else if (minNode)
    {
        minScore = +INFINITY;
        for (ind = 0 ; ind < nPossibleMoves; ind++) 
        {
            duplicateBoard(board, boardChild);
            x_ind = possibleMoves[ind][0];
            y_ind = possibleMoves[ind][1];
            updateboard(boardChild, x_ind, y_ind, cPlayer);
            int score = miniMax(boardChild,!minNode ,&x_ind ,&y_ind);
            if (minScore > score)
                minScore = score;
        }
        return minScore;
    }
    else if (!minNode)
    {
        maxScore = -INFINITY;
        for (ind = 0 ; ind < nPossibleMoves; ind++) 
        {
            duplicateBoard(board, boardChild);
            x_ind = possibleMoves[ind][0];
            y_ind = possibleMoves[ind][1];
            updateboard(boardChild, x_ind, y_ind, cComputer);
            int score = miniMax(boardChild,!minNode ,&x_ind ,&y_ind);
            if (maxScore < score)
            {
                maxScore = score;
                *xBest = x_ind;
                *yBest = y_ind;
            }
        }
        return maxScore;
    }

我完全不知道如何做到这一点。我很感激任何帮助:)

4

1 回答 1

7

如果它是嵌入式的,我会

  • 以二进制编码位置(位矩阵而不是 2dim 字节数组)
  • 编码完整的解决方案图,所以一切都只是一个查找(线性查找对于这种复杂性来说很好)

在此处输入图像描述

于 2011-11-14T07:36:46.800 回答