Depth-first iterative-deepening

Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.

Type

Journal article

Intellectual base

Primary research

Year

1985

Link

https://doi.org/10.1016/0004-3702(85)90084-0matched

Cited from

cognitive_science

Cited by

1 citation across 1 artifact.

Primes

• Problem Space
  • Structural tension: Exhaustive search guarantees finding an optimal solution (if one exists) but is intractable for large spaces; greedy heuristic search is fast but may miss globally optimal solutions and settle for local optima—a trade-off Korf (1985) addresses formally with iterative-deepening, which preserves completeness while bounding memory.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a80f35f47b87 · see in the full table