Advertisement

Some Methods of Controlling the Tree Search in Chess Programs

  • Grigori M. Adelson-Velskiy
  • Vladimir L. Arlazarov
  • Mikhail V. Donskoy

Abstract

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.

Keywords

Search Tree Active Schema Model Game Force Variation Game Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© David Levy 1988

Authors and Affiliations

  • Grigori M. Adelson-Velskiy
  • Vladimir L. Arlazarov
  • Mikhail V. Donskoy

There are no affiliations available

Personalised recommendations