The design and analysis of algorithms for asynchronous multiprocessors.
The design and analysis of algorithms for asynchronous multiprocessors.
Performance analysis of the technology chess program.
Performance analysis of the technology chess program.
Parallel Search of Strongly Ordered Game Trees
ACM Computing Surveys (CSUR)
Evolution of an efficient search algorithm for the mate-in-N problem in chess
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
| Hi-index | 0.00 |
Current game-playing programs have developed numerous move ordering and search reduction techniques in order to improve the effectiveness of the alpha-beta algorithm. A critical review of these search modifications is provided, and a recursive formula to estimate the search time is proposed, one which reflects the characteristics of the strongly ordered trees produced through use of improved search enhancements.