minimax algorithm checks however many moves depth is equal to ahead and chooses the best move for both themselves and the opposition each move. The goal of the ai is to minimize the score of the human player.
alpha beta pruning will speed up the move choosing process by not looking at choice branches if there is already a better option available. The ai can skip looking at parts of the choice tree but it is not guaranteed to happen.
minimax algorithm checks however many moves depth is equal to ahead and chooses the best move for both themselves and the opposition each move. The goal of the ai is to minimize the score of the human player.
alpha beta pruning will speed up the move choosing process by not looking at choice branches if there is already a better option available. The ai can skip looking at parts of the choice tree but it is not guaranteed to happen.