This week we learned about Adversarial Search that is used in games to considers the opponent’s move when deciding the best possible move. We studied about the minimax algorithm which maximizes our chances of winning by taking account enemy’s best move. The algorithm works on deterministic and non-deterministic games.

On top of that, we also discussed about alpha and beta pruning which eliminates the branches based on the information we have on the other branch. The pruning is centered around the idea that the enemy could cut unnecessary steps that the player wouldn’t take. This is implemented using DFS to try the finding the best path towards the solution.