{"type":"ScholarlyArticle","title":"Characterizing Search Spaces","authors":[{"name":"Roy Rada","slug":"roy-rada","given":"Roy","family":"Rada","affiliation":""}],"abstract":"A heuristic is good on a search space to the extent that it allows the prediction of which states are near to the goal. In this paper heuristics are investigated on several different search spaces. A measure is proposed for assessing the predictive accuracy of a given heuri stic on a given search space. Themeasure sheds light on characteristics of the Traveling Salesman Problem that make it computationally mor e difficult to solve than the Minimum Spanning-Tree Problem.","doi":null,"url":"https://ijcai.org/proceedings/1983/189","pdf":"https://ijcai.org/proceedings/1983/0189.pdf","markdown":"https://ijcai.org/proceedings/1983/189.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/189","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":189,"pages":{"first":780,"last":781},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}