Sign inSign in
ConceptAI & ML

Iterative deepening

A search strategy that repeatedly performs a depth-limited search, increasing the depth limit with each iteration until time runs out.
as Pieter Abbeel defines itUC BerkeleyThe wording closest to all 3 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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

  • Charles Leiserson

    MIT · Undergraduate

    Searching a game tree successively to increasing depths until a time limit is reached, leveraging results from shallower searches to order moves for deeper searches.
    • 39:08Speculative Parallelism & Leiserchess

Connections

7

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.