Intro to Artificial Intelligence - Minimax and AlphaBeta Search - Lecture 10
Offered By: Dave Churchill via YouTube
Course Description
Overview
Explore the fundamental concepts of Minimax and Alpha-Beta Search algorithms in this comprehensive lecture from the Introduction to Artificial Intelligence course at Memorial University. Delve into the algorithmic techniques and data structures used in modern AI problem-solving, with a focus on their application in game environments. Learn how these powerful search strategies are employed to make optimal decisions in adversarial scenarios. Gain practical insights into implementing Minimax and Alpha-Beta pruning to enhance the efficiency of game-playing AI systems. Understand the theoretical foundations and practical applications of these essential AI concepts through clear explanations and examples provided by Professor David Churchill.
Syllabus
COMP3200 - Intro to Artificial Intelligence - Lecture 10 - Minimax + AlphaBeta Search
Taught by
Dave Churchill
Related Courses
Game TheoryStanford University via Coursera Model Thinking
University of Michigan via Coursera Online Games: Literature, New Media, and Narrative
Vanderbilt University via Coursera Games without Chance: Combinatorial Game Theory
Georgia Institute of Technology via Coursera Competitive Strategy
Ludwig-Maximilians-Universität München via Coursera