ConceptAI & ML
Minimax algorithm
A logical, deterministic algorithm used in game trees where one player tries to maximize their score and the other tries to minimize it.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Patrick Winston
A decision rule for minimizing the possible loss for a worst case scenario, backing up values from leaf nodes alternately choosing maximum and minimum values at each level.Brian Yu
An algorithm used in game theory where one player tries to maximize the score and the other tries to minimize it.Mark Seifter
A depth-first search used in game trees to determine the best move by maximizing the player's potential gain while minimizing the opponent's potential gain.
Lectures that assume it
3Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Adversarial search
- Decision tree
- Depth-first search
- Alpha-beta pruning
- Alpha-beta strategy
- Depth-limited minimax
Show 2 moreShow fewer
Lectures7
- Search: Games, Minimax, and Alpha-Beta Pruning
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Artificial Intelligence
- Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)
- Search with Other Agents: Minimax
- Leiserchess Codewalk