Proceedings

Information Acquisition in Minimal Window Search

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 1040-1042.

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.

Alexander Reinefeld, Jonathan Schaeffer, and T. Anthony Marsland. 1985. Information Acquisition in Minimal Window Search. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 1040–1042. https://ijcai.org/proceedings/1985/210
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards