COMP6980 - Intro to Artificial Intelligence - Lecture 10 - MiniMax + AlphaBeta Search
00:00 - Intro
00:31 - Multiplayer Games
05:06 - Two Player Game AI
08:30 - Look-Ahead and Evaluate
13:00 - Game Tree Size
16:16 - Look-Ahead as Far as Possible
17:07 - Two Player Game Tree (Min + Max)
24:00 - MaxValue Algorithm (single depth)
26:02 - MaxValue Algorithm (full tree)
26:30 - MinValue Algorithm
28:33 - Depth Limit
29:53 - MiniMax Algorithm
32:13 - NegaMax Algorithm
34:14 - MiniMax Properties
36:42 - Alpha-Beta Pruning
46:09 - Alpha-Beta Example
59:23 - Computational Savings
01:00:16 - Alpha-Beta Algorithm
01:01:08 - Shortening the Algorithm
01:10:08 - Recording the Best Action
01:12:49 - Time Limit
01:13:25 - Iterative Deepening Alpha-Beta
01:20:33 - Exam Questions
Memorial University - Computer Science 6980 - Winter 2024
Intro to Artificial Intelligence
Professor: David Churchill - http://www.cs.mun.ca/~dchurchill/
This course is an introduction to Artificial Intelligence (AI), covering algorithmic techniques and data structures used in modern problem-solving environments. Each topic will have a related assignment where the learned techniques are applied to simple games. This is the graduate version of COMP 3200.
Course Assignments / Files will not be released publicly