Artificial Intelligence - Adversarial Search: Stochastic Games

Описание: Artificial Intelligence Course in Farzin Academy:
   • Artificial Intelligence - Introduction  

In this Farzin Academy video, we explore Stochastic Games — game trees that incorporate randomness, like dice rolls in backgammon or card draws in poker. 🎲♠️

You’ll learn how to model chance nodes, calculate expected values, and implement the Expectiminimax algorithm, which combines Minimax logic with probabilistic decision-making. We also show how to prune unnecessary branches, just like in deterministic games.

🧠 Key Topics Covered:

What are stochastic (chance-based) games?

How to compute expected utility of chance nodes

The Expectiminimax algorithm step-by-step

Worked example with probability and expectation

Pruning in stochastic game trees

Comparison with Minimax and Alpha-Beta

🎯 Ideal for AI students, game developers, and anyone interested in intelligent agents under uncertainty.

👉 Subscribe to Farzin Academy for more AI, search algorithms, and game theory tutorials!