We learned adversarial search functions which is the search functions that considers an opponent where they look for their own highest chance of winning. In particular we do minimax and the concept of pruning. minimax tries to maximize our chance of winning with the thought that the opponent would do their own optimal moves.the concept of pruning takes into account that some outcomes are not important because they are inferior hence we can cut them off to minimize processing time. IDS is with consideration to time restraints of some games. we are told to do some exercises to do an ab algorithm on a set tree with the pruning shown. The concept of zero sum game and non zero sum games are told in order to differentiate that not all game theory is zero sum.
The lights went out today hence it created a situation of delight in the middle. Yet this delayed our studies a bit.