Artificial Intelligence - Adversarial Search: Minimax Algorithm
Artificial Intelligence Course in Farzin Academy:
• Artificial Intelligence - Introduction
In this Farzin Academy video, we dive into the Minimax Algorithm, a cornerstone of game theory and adversarial search used in two-player zero-sum games like tic-tac-toe, chess, and more. 🎯
You’ll learn how the MAX player tries to maximize the utility while assuming the MIN player minimizes it — modeling rational adversarial behavior. Through clear visual game trees and code explanation, we walk through how Minimax evaluates the best move using a recursive approach.
🧠 Topics Covered:
What is a zero-sum game?
Game trees and alternating MAX/MIN layers
Utility values and terminal states
Minimax algorithm walkthrough with diagrams
Python-style pseudocode of Minimax
Example: Which move should MAX choose?
🎯 Perfect for CS students, AI learners, and competitive programmers studying game trees and optimal decision-making.
👉 Subscribe to Farzin Academy for more algorithms, AI logic, and CS theory explained visually.