Sign inSign in
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.
as David J. Malan defines itHarvard UniversityThe wording closest to all 4 definitions
Watch it explained

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

4

Each in their own terms, from the easiest level.

  • Patrick Winston

    MIT · Undergraduate

    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.
    • 17:17Search: Games, Minimax, and Alpha-Beta Pruning
  • Brian Yu

    Harvard University · Undergraduate

    An algorithm used in game theory where one player tries to maximize the score and the other tries to minimize it.
    • 1:25:11Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Mark Seifter

    MIT · Undergraduate

    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.
    • 2:14Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)

Lectures that assume it

3

Connections

15

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.