Sign inSign in
ConceptAI & ML

Alpha-beta pruning

An optimized search algorithm for minimax that eliminates branches in the search tree that do not need to be evaluated.
as Mark Seifter defines itMITThe wording closest to all 6 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

5

Each in their own terms, from the easiest level.

  • Mark Seifter

    MIT · Undergraduate

    A deterministic search algorithm for game trees that converges with certain tree-based methods over time.
  • Patrick Winston

    MIT · Undergraduate

    An algorithm that adds alpha and beta parameters to minimax to prune large sections of the search tree without affecting the final decision.
    • 23:36Search: Games, Minimax, and Alpha-Beta Pruning
  • Brian Yu

    Harvard University · Undergraduate

    An optimization technique for minimax that allows us to eliminate searching through certain branches of the game tree by keeping track of the best and worst scores seen so far.
    • 1:45:56Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Pieter Abbeel

    UC Berkeley · Undergraduate

    An optimization technique for the minimax algorithm that eliminates branches that cannot possibly influence the final decision.
    • 47:31Search with Other Agents: Minimax
  • Pieter Abbeel & Daniel Klein

    UC Berkeley · Undergraduate

    An algorithm that reduces the size of the game tree search space, theoretically square rooting it.
    • 11:01Robotics, Language, and Vision

Lectures that assume it

3

Connections

18

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

5 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.