A chess mating combinations program

Authors:
George W. Baylor;Herbert A. Simon
Affiliations:
Carnegie Institute of Technology, Pittsburgh, Pennsylvania;Carnegie Institute of Technology, Pittsburgh, Pennsylvania
Venue:
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Year:
1966

Citing 3
Cited 4

Chess-playing programs and the problem of complexity

Computers & thought
Some studies in machine learning using the game of checkers

Computers & thought
Empirical explorations with the logic theory machine: a case study in heuristics

Computers & thought

The Greenblatt chess program

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Program and protocol analysis on a mental imagery task

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Artificial intelligence research strategies in the light of AI models of scientific discovery

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Finding resolution proofs and using duplicate goals in and/or trees

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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. A checkmating combination, then, is a combination in which that objective advantage is checkmate. 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.