Mega-R3. Games, Minimax, Alpha-Beta

MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course:
Instructor: Mark Seifter

This mega-recitation covers Problem 1 from Quiz 2, Fall 2007. We start with a minimax search of the game tree, and then work an example using alpha-beta pruning. We also discuss static evaluation and progressive deepening (Problem 1-C, Fall 2008 Quiz 2).

License: Creative Commons BY-NC-SA
More information at
More courses at