Opening Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)
Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)
- Length
- 51 min
- Level
- Undergraduate
- Recorded
- MIT2014
Chapter 1 of 7: Before the lecture
MIT 6.034 Artificial Intelligence session 25 is an undergraduate mega-recitation on depth-first minimax and alpha-beta pruning. Seifter works through Problem 1 of Quiz 2, Fall 2007, then uses Problem 1-C, Fall 2008, to explain progressive deepening.
Your comment is kept while you sign up.Sign in
Derives the minimax value and alpha-beta pruning order on a game tree using the Snow White principle.
MIT 6.034 Artificial Intelligence session 25 is an undergraduate mega-recitation on depth-first minimax and alpha-beta pruning. Seifter works through Problem 1 of Quiz 2, Fall 2007, then uses Problem 1-C, Fall 2008, to explain progressive deepening.
This lecture
Lecture 25 of 27 of Artificial Intelligence.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.