{"type":"ScholarlyArticle","title":"Information Acquisition in Minimal Window Search","authors":[{"name":"Alexander Reinefeld","slug":"alexander-reinefeld","given":"Alexander","family":"Reinefeld","affiliation":""},{"name":"Jonathan Schaeffer","slug":"jonathan-schaeffer","given":"Jonathan","family":"Schaeffer","affiliation":""},{"name":"T. Anthony Marsland","slug":"t-anthony-marsland","given":"T. Anthony","family":"Marsland","affiliation":""}],"abstract":"The alpha-beta tree search algorithm can be improved through the use of minimal windows. Branches are searched with a minimal window [a,a+ 1] with the expectancy that this will show the sub-tree to be inferior. If not, then that sub-tree m ust be re-searched. In this paper, several methods are discussed to minimize the cost of the re-search. Two new algorithms, INS and PNS, are introduced and their performance on practical trces is shown tobe comparable to SSS*, but with considerably smaller overhead.","doi":null,"url":"https://ijcai.org/proceedings/1985/210","pdf":"https://ijcai.org/proceedings/1985/0210.pdf","markdown":"https://ijcai.org/proceedings/1985/210.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/210","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":210,"pages":{"first":1040,"last":1042},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}