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.
KeywordsGame Tree Master Program Mate Position Double Check Mate Routine
Unable to display preview. Download preview PDF.