Information Acquisition in Minimal Window Search
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+l] with the expectancy that this will show the sub-tree to be inferior. If not, then that sub-tree must 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 trees is shown to be comparable to SSS*, but with considerably smaller overhead.
Cite
Text
Reinefeld et al. "Information Acquisition in Minimal Window Search." International Joint Conference on Artificial Intelligence, 1985.Markdown
[Reinefeld et al. "Information Acquisition in Minimal Window Search." International Joint Conference on Artificial Intelligence, 1985.](https://mlanthology.org/ijcai/1985/reinefeld1985ijcai-information/)BibTeX
@inproceedings{reinefeld1985ijcai-information,
title = {{Information Acquisition in Minimal Window Search}},
author = {Reinefeld, Alexander and Schaeffer, Jonathan and Marsland, T. Anthony},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1985},
pages = {1040-1043},
url = {https://mlanthology.org/ijcai/1985/reinefeld1985ijcai-information/}
}