Sign inSign in
ConceptAI & ML

Progressive deepening

An iterative search strategy that explores game trees to successively deeper levels to reorder nodes and improve alpha-beta pruning efficiency.
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.

Game tree search2Alpha-beta pruning1Heuristic evaluation1Minimax1Minimax search1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Patrick Winston

    MIT · Undergraduate

    An iterative search strategy where shallow searches are performed first to provide move orderings and time-guarded policies for deeper searches.
    • 40:27Search: Games, Minimax, and Alpha-Beta Pruning

Connections

6

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

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.