Mate at a Glance

  • John Birmingham
  • Peter Kent


Current tournament level chess programs use several different systems to detect checkmate within the game tree.

This paper discusses two popular systems and then describes a routine incorporated into the master program (Birmingham et al., 1980) which detects mate and certain forced mate situations (‘pseudo’ mate) at the static level.

A set of rules is given, by which mate or ‘pseudo’ mate positions may be recognised given a small amount of knowledge.


Game Tree Master Program Mate Position Double Check Mate Routine 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© David Levy 1988

Authors and Affiliations

  • John Birmingham
  • Peter Kent

There are no affiliations available

Personalised recommendations