Back to Adversarial Search

Minimax Algorithm Explained

Step-by-Step Walkthrough with Tic-Tac-Toe

Learn how MAX and MIN make optimal decisions
1

Welcome to Minimax!

Let's learn how the Minimax algorithm works using a simple tic-tac-toe example.
Current Game State
X
O
X
O

X (MAX) to move
X needs to find the best move using Minimax

Minimax Analysis

Click "Next Step" to begin the Minimax walkthrough!

Available Moves for X

We'll explore X's possible moves and calculate their utilities using Minimax.