An Optimistic Pondering Approach for Asynchronous Distributed Game-Tree Search

Article type: Research Article

Authors: Himstedt, Kai^{; 1}

Affiliations: Hamburg, Germany

Note: [1] Department of Computer Science, University of Hamburg, Vogt-Koelln-Str. 30, 22527 Hamburg, Germany. Email : himstedt@informatik.uni-hamburg.de

Abstract: Taking computer chess as an example an idea is presented how to use the early available principal variations for optimistic pondering under real match conditions, even before the opponent is on move. This way, several processors of a distributed environment can be used to search asynchronously ahead in parallel to achieve a greater thinking-time amount for the game-tree search of a single move. The actual principal variations which can be provided by all typical chess programs during their iterative deepening are the only information needed for this method. The implementation of the idea for a prototypical environment is described and the major results collected so far from this environment are presented.

DOI: 10.3233/ICG-2005-28203

Journal: ICGA Journal, vol. 28, no. 2, pp. 77-90, 2005