Главная
Study mode:
on
1
- Preroll
2
- Greetings
3
- Lecture Start
4
- Multiplayer Games
5
- Game Playing Algorithms
6
- Look-Ahead and Evaluate
7
- Game Tree Size
8
- Look-Ahead as Far as Possible
9
- Tree Search with Multiple Players
10
- MaxValue and MinValue Functions
11
- MiniMax Algorithm
12
- Megamax Algorithm
13
- MiniMax Properties & NE
14
- Alpha-Beta Pruning
15
- Alpha-Beta Visual Example
16
- Alpha-Beta Computational Savings
17
- Alpha-Beta MaxValue and MinValue
18
- Alpha-Beta Single Algorithm
19
- Shortening the Alpha-Beta Algorithm
20
- Recording the Best Action
21
- Implementing a Time Limit
22
- Iterative Deepening Alpha-Beta
23
- Exam Questions
24
- Assignment 3 Explained
25
- A3 GUI Explained
26
- A3 Testing Functions
27
- A3 Code - GameState
28
- Sample Players
29
- Player_Student
30
- IDAlpheBeta Function
31
- AlphaBeta Function
32
- Eval Function
33
- Marking Scheme
34
- AlphaBeta Debugging Tips
Description:
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore a comprehensive lecture on artificial intelligence game-playing algorithms, focusing on Minimax, Alpha-Beta pruning, and their implementation. Dive into multiplayer game strategies, tree search techniques, and algorithm optimizations. Learn about look-ahead evaluation, game tree size considerations, and iterative deepening. Gain practical insights through exam question discussions and a detailed explanation of Assignment 3, including GUI usage, testing functions, and code implementation for various player types. Master the intricacies of AlphaBeta debugging and understand the marking scheme for the assignment.

Introduction to Artificial Intelligence: Minimax, Alpha-Beta Pruning, and Assignment 3 - Lecture 10

Dave Churchill
Add to list
0:00 / 0:00