ConceptAI & ML
Minimax
An algorithm for deterministic two-player zero-sum games where one player maximizes score and the other minimizes 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.
Adversarial search2Game tree2Decision tree1Depth-first search1Game theory1Search tree1State-space search1Zero-sum game1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
David J. Malan
An algorithm that alludes to the idea of trying to minimize and or maximize something as your function, your goal.Pieter Abbeel
A strategy for zero-sum games where one player maximizes the result and the other minimizes it, assuming both play optimally.Pieter Abbeel & Daniel Klein
An adversarial search algorithm about solving games in competitive environments by minimizing the opponent's maximum possible score.
Lectures that assume it
5Connections
18The lectures that define it or assume it, and the concepts next to it.