Sign inSign in
ConceptSystems & CS

Null-move pruning

A pruning method that skips a move to perform a shallower search and check if the subtree still triggers a beta cutoff.
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.

Alpha-beta pruning1Beta cutoff1Game tree search1Zugzwang1

Lecturers

2

Each in their own terms, from the easiest level.

  • Charles Leiserson

    MIT · Undergraduate

    A heuristic where a player forfeits their move and searches a shallower depth, pruning the subtree if the resulting position still yields a cutoff.
    • 46:05Speculative Parallelism & Leiserchess

Connections

3

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

Concept1

Lectures2

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