Minimax: How Computers Play Games

An introduction to Minimax, an algorithm that can be used to find the best move to play in an adversarial game like Tic-Tac-Toe, Chess, Go, and more. We explore how the algorithm works and some techniques we can use to make the algorithm more efficient.

0:00 Introduction
0:24 Minimax
5:12 Algorithm Pseudocode
8:42 Game Trees
10:28 Alpha-Beta Pruning
12:19 Evaluation Functions

***

Spanning Tree is an educational video series about computer science and mathematics. See more at https://spanningtree.me

To be notified when a new video is released, sign up for the Spanning Tree mailing list at https://spanningtree.substack.com/

Spanning Tree is created by Brian Yu. https://brianyu.me/

Email me at [email protected] to suggest a future topic.