6: Adversarial Search
Slides
Contents
- A presentation of games in AI and the Minimax algorithm.
- A presentation of the alpha-beta prunning algorithm.
- A discussion on how to deal with resource limits when implementing games.
Required Reading
R&N Sections 5.1–5.4 or NIE Chapter (5) "Adversarial Search", Sections 1–4.
NOTE: The abbreviation R&N refers to :
“Artificial Intelligence: A Modern Approach” Third Edition, Russell R & Norvig P, Prentice Hall, 2010 (R&N).
The abbreviation NIE stands for the following edition of the same book:
“Artificial Intelligence: A Modern Approach” Third Edition, Pearson New International Edition, Russell R & Norvig P, Pearson, 2014.
Quiz: Adversarial Search
These questions are designed to test your understanding of the course content in Lecture 7; doing this quiz does not contribute to your overall grade, but we can give some formative feedback. This quiz requires that you have gone through Lecture 7 and done the required reading. Some of the questions require a short text answer. You can ask for formative feedback from your tutor or on piazza.