In this week we learn about adversarial search, there are many topics today such as :

– Minimax algorithm where there it takes min/max value based on the level of the tree.
-Small Introduction of AI Games such as backgammon and chess.
-Alpha-Beta pruning which aims to decrease the number of nodes when a search occurs towards the tree.
– Game playing as Search which has an initial state, the legal movement and the result.
-Non-deterministic Games
etc.

The most interesting part of the day is a sudden light off in the FX mall, we were all ready to go home but unfortunately, the light went on again after 3 minutes, I was super disappointed but at least we can listen to the class since IS is very hard.

The most challenging part of the day are the tasks because to analyze the whole topics again its very hard for me, I need to work with my friends in order to understand the whole things.