Module
Adversarial Search and Games
Sign in to add this module to your path and practice.
About
Deterministic perfect-information games: minimax, alpha-beta pruning, evaluation functions, move ordering, Monte-Carlo Tree Search intro; imperfect information and chance (expectiminimax) light.
Goal
Implement minimax + alpha-beta for a two-player game (e.g., Tic-Tac-Toe or simplified chess/checkers); design evaluation functions; explain pruning effectiveness.
Prerequisites
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Adversarial Search and Games. Ask about the concepts, goal, or where you're stuck.