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