New Results in Deep-Search Behaviour

This article is a follow-up on previous work on deep-search behaviour of chess programs. The program CRAFTY was used to repeat the go-deep experiment on positions taken from previous experiments to push the search horizon to 20 plies. The same experimental setup was used to search, among others, a s...

Full description

Saved in:
Bibliographic Details
Published in:ICGA journal 2005-12, Vol.28 (4), p.203-213
Main Author: Steenhuisen, J. Renze
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article is a follow-up on previous work on deep-search behaviour of chess programs. The program CRAFTY was used to repeat the go-deep experiment on positions taken from previous experiments to push the search horizon to 20 plies. The same experimental setup was used to search, among others, a set of 4,500 positions, from the opening phase, to a depth of 18 plies. Our results showed that the chance of new best moves being discovered decreases exponentially when searching to higher depths, and decreases faster for positions closer to the end of the game. This contribution brings the understanding of deep-search behaviour and the prediction of performance a step further to completion.
ISSN:1389-6911
2468-2438
DOI:10.3233/ICG-2005-28402