@article{Korf:1985:DIO:4433.4436,
Address = {Essex, UK},
Author = {Korf, Richard E.},
File = {Depth-first Iterative-deepening An Optimal Admissible Tree Search - Korf (1) (0) - a - a - z.pdf},
ISSN = {0004-3702},
Journal = {Artif. Intell.},
Month = {September},
Number = {1},
Pages = {97--109},
Publisher = {Elsevier Science Publishers Ltd.},
Title = {Depth-first Iterative-deepening: An Optimal Admissible Tree Search},
URL = {http://dx.doi.org/10.1016/0004-3702(85)90084-0},
Volume = {27},
Year = {1985},
acmid = {4436},
bdsk-url-1 = {http://en.wikipedia.org/wiki/Iterative\_deepening\_depth-first\_search},
bdsk-url-2 = {http://www.youtube.com/watch?v=7QcoJjSVT38},
bdsk-url-3 = {http://dx.doi.org/10.1016/0004-3702(85)90084-0},
date-added = {2014-03-06 12:26:57 +0000},
date-modified = {2014-03-06 12:26:57 +0000},
file-2 = {Depth-first Iterative-deepening An Optimal Admissible Tree Search - Korf (2) (0) - a - a - z.pdf},
file-3 = {Depth-first Iterative-deepening An Optimal Admissible Tree Search - Korf (0) (0) - a - a - z.pdf},
issue_date = {Sept. 1985},
numpages = {13},
doi = {10.1016/0004-3702(85)90084-0}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A