Abstract
The development and analysis of a static exchange evaluator (SEE) is a challenging issue. The SEE is an important module of the computer-chess architecture for the qualitative and quantitative evaluation of moves and threatened squares. By means of the αβ-window, on which the static exchange evaluation is based, it is also possible to implement pruning conditions. The benefit of these pruning conditions is a reduction of the iterative computation. This article deals with the theoretical elements and the implementation of different SEE algorithms.
Get full access to this article
View all access options for this article.