MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course: http://ocw.mit.edu/6034F10'>http://ocw.mit.edu/6034F10
Instructor: Patrick Winston

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

License: Creative Commons BYNCSA
More information at http://ocw.mit.edu/terms'>http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu