A chess mating combinations program
George W. Baylor, Herbert A. Simon · 1966
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.
Cited by 39 works. doi:10.1145/1464182.1464233
Authors
References
- Games and Decisions
- Trial and error search in solving difficult problems: Evidence from the game of chess
- AN EXAMPLE OF HUMAN CHESS PLAY IN THE LIGHT OF CHESS PLAYING PROGRAMS
- Screening Solutions to Upgrade Quality: A New Approach to Problem Solving Under Conditions of Uncertainty
- A note on serendipity, aesthetics, and problem solving