Depth-first iterative-deepening: an optimal admissible tree search

@inproceedings{Korf1991DepthfirstIA,
  title={Depth-first iterative-deepening: an optimal admissible tree search},
  author={Richard E. Korf},
  year={1991}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 784 CITATIONS, ESTIMATED 22% COVERAGE

Solving moving-blocks problems

VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Achieving Goals Quickly Using Real-time Search: Experimental Results in Video Games

  • J. Artif. Intell. Res.
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Extended beam search for non-exhaustive state space analysis

  • J. Log. Algebr. Program.
  • 2012
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Monte Carlo Chess Erklärung Zur Bachelor-thesis

Johannes Fürnkranz, Tag der Einreichung, Erklärung zur Bachelor-Thesis
  • 2012
VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Planning with SAT, Admissible Heuristics and A*

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Towards a General Framework for Effective Solutions to the Data Mapping Problem

VIEW 21 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A General Theory of Additive State Space Abstractions

VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Linear-time disk-based implicit graph search

  • J. ACM
  • 2008
VIEW 14 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1989
2019

CITATION STATISTICS

  • 120 Highly Influenced Citations

  • Averaged 38 Citations per year over the last 3 years

Similar Papers

Loading similar papers…