{"type":"ScholarlyArticle","title":"Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory","authors":[{"name":"Anup K. Sen","slug":"anup-k-sen","given":"Anup K.","family":"Sen","affiliation":""},{"name":"Amitava Bagchi","slug":"amitava-bagchi","given":"Amitava","family":"Bagchi","affiliation":""}],"abstract":"MREC is a new recursive best-first search algorithm which combines the good features of A* and IDA*. It is closer in operation to IDA*, and does not use an OPEN list. In order to execute, all MREC needs is sufficient memory for its implicit stack. But it can also be fed at runtime a parameter M which tells it how much additional memory is available for use. In this extra memory, MREC stores as much a<; possible of the explicit graph. When M = 0, MREC is identical to IDA*. But when M > 0, it can make far fewer node expansions than IDA*. This can be advantageous for problems where the time to expand a node is significant. Extensive runs on a variety of search problems, involving search graphs that may or may not be trees, indicate that MREC with M = 0 is as good as IDA* on problems such as the 15puzzle for which IDA* is suitable, while MREC with large M is as fast as A* on problems for which node expansion time is not negligible.","doi":null,"url":"https://ijcai.org/proceedings/1989/47","pdf":"https://ijcai.org/proceedings/1989/0047.pdf","markdown":"https://ijcai.org/proceedings/1989/47.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/47","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search","track":"Search","number":47,"pages":{"first":297,"last":301},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}