6.034 | Fall 2010 | Undergraduate

Artificial Intelligence

Lecture Videos

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

Description: 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

Course Info

As Taught In
Fall 2010
Learning Resource Types
Exams
Lecture Videos
Recitation Videos
Programming Assignments
Instructor Insights