{"type":"ScholarlyArticle","title":"Iterative-Deepening-A*: An Optimal Admissible Tree Search","authors":[{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"abstract":"A serious Iimitation of the A * algorithm is that in prac ti ce it requires space which is exponential in the so lu t ion cost. We propose an JteratJve-deepemng ex tension to A * which only requires linear space. The algori t hm JS admJssJble and expands the same number of nodes, asymptotically, as A* for exponent1al tree search es. This algorithm is the only known algonthm th at Js capable of finding optimal solutions to randomly gener ated instances of the Fifteen Puzzle within pra ctical r es ource Iimits.","doi":null,"url":"https://ijcai.org/proceedings/1985/208","pdf":"https://ijcai.org/proceedings/1985/0208.pdf","markdown":"https://ijcai.org/proceedings/1985/208.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/208","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":208,"pages":{"first":1034,"last":1035},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}