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

MIT Artificial Intelligence, Fall 2010 View the complete course: Instructor: Patrick Winston 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. License: Creative Commons BY-NC-SA More information at More courses at