Lecture 6: Search: Games, Minimax, and Alpha-Beta

Artificial Intelligence Course

In this lecture, we consider strategies for adversarial games such as chess. We discuss the minimax algorithm, and how alpha-beta pruning improves its efficiency. We then examine progressive deepening, which ensures that some answer is always available. Instructor: Patrick H. Winston

Lessons in this module

Lecture 6: Search: Games, Minimax, and Alpha-Beta start lesson