Topic: Adversarial Search

This session we discussed the concept of adversarial search, which is an algorithm which puts opponents into consideration when deciding the best possible move for a game. We went in more depth about the minimax principle, which talks about maximizing our chances on winning based on what the opponent decides to do.

We also discussed alpha and beta pruning, which is the elimination of certain branches based on the information we currently already have from the other branch. It is implemented using Depth First Search (DFS) and tries as to find the best path towards the solution.

The algorithm is applicable for both deterministic and non-deterministic games. We were tested with exercises in implementing these algorithms graphically.