Some Methods of Controlling the Tree Search in Chess Programs
This paper describes several tree methods that have been implemented in our chess playing program (kaissa) and some perspectives on this domain. The most general and most flexible method of program organization is exhaustive search with cut-offs. Therefore our program is based on searching exhaustively to a given depth, and permitting wide usage of cut-offs at any level of the search tree. Besides the program includes analysis of all exchanges up to their end. Experience with earlier programs has shown that disregard of exchanges would lead to gross errors.
KeywordsSearch Tree Active Schema Model Game Force Variation Game Tree
Unable to display preview. Download preview PDF.