𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Accuracy and savings in depth-limited capture search

✍ Scribed by Prakash Bettadapur; T.A. Marsland


Book ID
104140028
Publisher
Elsevier Science
Year
1988
Weight
280 KB
Volume
29
Category
Article
ISSN
0020-7373

No coin nor oath required. For personal study only.

✦ Synopsis


Capture search, an expensive part of any chess program, is conducted at every leaf node of the approximating game tree. Often an exhaustive capture search is not feasible, and yet limiting the search depth compromises the result. Our experiments confirm that for chess a deeper search results in less error, and show that a shallow search does not provide significant savings. It is therefore better to do an arbitrary depth capture search. If a limit is used for search termination, an odd depth is preferable.


πŸ“œ SIMILAR VOLUMES