{"type":"ScholarlyArticle","title":"Increasing Tree Search Efficiency for Constraint Satisfaction Problems","authors":[{"name":"Robert M. Haralick","slug":"robert-m-haralick","given":"Robert M.","family":"Haralick","affiliation":""},{"name":"Gordon L. Elliott","slug":"gordon-l-elliott","given":"Gordon L.","family":"Elliott","affiliation":""}],"abstract":"In this paper we explore the number of consistency checks made by a tree sear c h in o rder t o solve binary constraint satisfaction problems. l~e show analytically and experimentally that the two principles of first trying the pla c es most likely to fail and remembering wh a t ha s be en done to avoid repeating the same mistake twice improve the standard backtrac k ing sear c h. We experimentally show that a lookahead pro c edure called forward c hecking (to remember the future) which employs the most likely to fail principle performs better than standard b ac ktracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all c ases t e sted, and better than Gaschnigs backmarking in the larger problems.","doi":null,"url":"https://ijcai.org/proceedings/1979/78","pdf":"https://ijcai.org/proceedings/1979/0078.pdf","markdown":"https://ijcai.org/proceedings/1979/78.md","bibtex":"https://ijcai.org/proceedings/1979/bibtex/78","volume":{"slug":"1979","title":"Proceedings of the Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1979","url":"https://ijcai.org/proceedings/1979/","year":1979,"location":"Tokyo, Japan","dates":"August 20-23, 1979","editors":"Bruce G. Buchanan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":78,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}