Skip to content
Kudos AI
enfrar

AI Search and Game Theory

Deciding what to do when another agent is deciding too: optimal play against an adversary, pruning the search, and equilibrium when interests only partly conflict.

Intermediate260 XP~1 h90% to advance

Sign in to take quizzes, earn XP, and unlock stages as you reach 90% mastery.

Sign inCreate account

  1. Minimax and Alpha-Beta Pruning

    30 min · 120 XP

    Propagating values up a game tree under an optimal-opponent assumption, and cutting branches that provably cannot change the answer.

    Open lesson →

    Sign in to take the 2-question quiz.

  2. Dominance and Nash Equilibrium

    30 min · 140 XP

    Payoff matrices, dominant strategies, the prisoner’s dilemma, and why a stable equilibrium can still be worse for everyone.

    Open lesson →

    Sign in to take the 3-question quiz.

Key concepts

MinimaxNash EquilibriumDominant StrategyMixed StrategyPrisoner’s Dilemma
Complete all modules → earn the AI Search and Game Theory badge