This week’s lecture is about adversarial search, which the main topic for the lecture is about minimax. Which is usually used for an automated computer playing games to search for the which move should they do next.

The concept of this search is similar to Depth First Search (DFS), the tree will have an interchanging minimum and maximum, which represent the interchanging player after player 1 have their turns and player 2 will move next. The purpose of the min and max is to make sure that the 2 players have different choice of options depending on what the previous player moves.
This automated game is usually for 2D games such as, chess, go, tic tac toe, et cetera.

As for the project, we are sure to say that we are going to use tensorflow, however, what kind of projects we are going to make is still