Pre-Searching
- Markian Hlynka
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
This paper introduces the idea of pre-searching a position searching it before determines that it needs to be searched. Consider the case where an iteration of search comes across a position p that needs to be searched to depth d1, and the transposition table reveals that p will likely need to be searched later in that iteration to depth d2 greater than d1. Pre-searching involves speculatively searching p to depth d2, even though it has not been demonstrated that search to this depth is needed. If the gamble is successful, then additional accuracy is introduced to the search (using a result with extra search depth d2 − d1). While any search extension scheme is not without some risk, empirical results indicate that the impact on the search tree size is small, but the additional accuracy that is introduced improves program performance.
Citation
M. Hlynka, J. Schaeffer. "Pre-Searching". Journal of the International Computer Games Association (ICGA), 27(4), pp 203-208, January 2005.| Keywords: | |
| Category: | In Journal |
BibTeX
@article{Hlynka+Schaeffer:ICGA05,
author = {Markian Hlynka and Jonathan Schaeffer},
title = {Pre-Searching},
Volume = "27",
Number = "4",
Pages = {203-208},
journal = {Journal of the International Computer Games Association (ICGA)},
year = 2005,
}Last Updated: March 07, 2007Submitted by AICML Admin Assistant
