Some methods of controlling the tree search in chess programs

摘要

This paper describes several tree search 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.