Depth-first iterative-deepening: an optimal admissible tree search. Korf, R. E. AIJ, 27:97–109, 1985. bibtex @article{Korf:1985b,
author = "Korf, R. E.",
year = "1985",
title = "Depth-first iterative-deepening: an optimal admissible tree search",
journal = aij,
volume = "27",
pages = "97--109"
}
Downloads: 0
{"_id":"qnxjoWa24vSWBMFdR","bibbaseid":"korf-depthfirstiterativedeepeninganoptimaladmissibletreesearch-1985","author_short":["Korf, R. E."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Korf"],"firstnames":["R.","E."],"suffixes":[]}],"year":"1985","title":"Depth-first iterative-deepening: an optimal admissible tree search","journal":"AIJ","volume":"27","pages":"97–109","bibtex":"@article{Korf:1985b,\n\tauthor = \"Korf, R. E.\",\n\tyear = \"1985\",\n\ttitle = \"Depth-first iterative-deepening: an optimal admissible tree\tsearch\",\n\tjournal = aij,\n\tvolume = \"27\",\n\tpages = \"97--109\"\n}\n\n","author_short":["Korf, R. E."],"key":"Korf:1985b","id":"Korf:1985b","bibbaseid":"korf-depthfirstiterativedeepeninganoptimaladmissibletreesearch-1985","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://aima.cs.berkeley.edu/aima4e.bib","dataSources":["cx4WvnDhXJhiLqdQo"],"keywords":[],"search_terms":["depth","first","iterative","deepening","optimal","admissible","tree","search","korf"],"title":"Depth-first iterative-deepening: an optimal admissible tree search","year":1985}