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

Name: Lecture 6: Search: Games, Minimax, and Alpha-Beta
Uploaded: 2014-01-10T19:37:13Z
Duration: 48 min 17 s
Description: 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

48:17

Up Next

Lecture 7: Constraints: Interpreting Line Drawings

Continue

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