Reading: AIAMA 5.1-5.2
This section of the text introduces our first look at multi-agent environments, ones in which two agents compete. This is explored through the use of simple two-player games. Section 5.1 specifies what kind of games we are considering and how they fit into state-space search. Section 5.2 introduces the overall idea behind two-player game search and a simple algorithm called minimax (or min-max).
Questions you should be able to answer after reading are: