6. Search: Games, Minimax, and Alpha-Beta
MIT 6.034 Artificial Intelligence, Fall 2010
View the complete course: http://ocw.mit.edu/6-034F10
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 http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 6. Search: Games, Minimax, and Alpha-Beta канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-034F10
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 http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 6. Search: Games, Minimax, and Alpha-Beta канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
How do modern chess engines work?
A tutorial of Stochastic Game
Algorithms Explained – minimax and alpha-beta pruning
7. Constraints: Interpreting Line Drawings
How does a Board Game AI Work? (Connect 4, Othello, Chess, Checkers) - Minimax Algorithm Explained
Deepmind AlphaZero - Mastering Games Without Human Knowledge
How To Speak by Patrick Winston
6. Monte Carlo Simulation
CS50 2020 - Artificial Intelligence
4. Search: Depth-First, Hill Climbing, Beam
5. Search: Optimal, Branch and Bound, A*
1. Introduction and Scope
minimax algorithm
12a: Neural Nets
Minimax with Alpha Beta Pruning
1. Introduction for 15.S12 Blockchain and Money, Fall 2018
3. Reasoning: Goal Trees and Rule-Based Expert Systems
Coding an UNBEATABLE Tic Tac Toe AI (Game Theory Minimax Algorithm EXPLAINED)
Lecture 9: Game Playing 1 - Minimax, Alpha-beta Pruning | Stanford CS221: AI (Autumn 2019)