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
Instructor
Departments
As Taught In
Fall
2010
Level
Course Info
Instructor
Departments
As Taught In
Fall
2010
Level
Learning Resource Types
grading
Exams
Instructor Insights
theaters
Lecture Videos
theaters
Problem-solving Videos
assignment
Programming Assignments
