Method getBestMove

MachineGame.cpp:243–283

}

ChessStep* MachineGame::getBestMove()
{
    int depth = getSearchDepth();
    QVector<ChessStep*> steps;
    bool aiIsRedTurn = m_bIsRed;
    getAllMoves(steps, aiIsRedTurn);

    if (steps.isEmpty()) {
        whoWin();
        return nullptr;
    }

    // 走法排序：吃子走法优先
    std::sort(steps.begin(), steps.end(), [](ChessStep* a, ChessStep* b) {
        return (a->m_nKillID != -1) > (b->m_nKillID != -1);
    });

    int bestScore = INT_MIN;
    ChessStep* bestStep = nullptr;

    for (auto* step : steps) {
        fakeMove(step);
        int score = alphaBeta(depth - 1, INT_MIN, INT_MAX, false);
        unFakeMove(step);

        if (score > bestScore) {
            bestScore = score;
            bestStep = step;
        }
    }

    // 清理未使用的 step
    for (auto* s : steps) {
        if (s != bestStep) delete s;
    }

    if (!bestStep)
        whoWin();

    return bestStep;
}

void MachineGame::machineChooseAndMovePieces()
{