General Approach for Adversarial Search

gistfile1.cpp

int AI::IterativeDeepening(const State& state, int alpha, int beta, int depth) {
    if (cutoff(state, depth))
        return eval(state);
    int result = 0;
    for (Move* move : moves) {
        State newState = state.clone();
        result = max(result, newState.makeMove(state));
    }
    return result;
}

bool AI::cutoff(const State& state, int depth) {
    return state->isEndGame() || depth == 0;
}

// TODO: Implement this
int AI::eval(const State& state) {
    return 0;
}