A Chess Mating Combinations Program

  • George Baylor
  • Herbert Simon

Abstract

The program reported here is not a complete chess player; it does not play games. Rather, it is a chess analyst limited to searching for checkmating combinations in positions containing tactical possibilities. A combination in chess is a series of forcing moves with sacrifice that ends with an objective advantage for the active side (Botvinnik, 1960). A checkmating combination, then, is a combination in which that objective advantage is check-mate.† Thus the program described here — dubbed mater — given a position, proceeds by generating that class of forcing moves that put the enemy King in check or threaten mate in one move, and then by analyzing first those moves that appear most promising.

Keywords

Hunt Defend Metaphor Veri 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© David Levy 1988

Authors and Affiliations

  • George Baylor
  • Herbert Simon

There are no affiliations available

Personalised recommendations