In order to find mating sequences fast, BCP's Quiescence Search includes checks if and only if they have one (or no) reply [2]. The original intention of this rule was to detect some (relativly) frequent cased of mate in two, but Don Beal obsearved the search time only increased marginally when the depth limit was removed.
Table of Contents
BCP,
Don Beal's Chess Program, which participated at four World Computer Chess Championships, the WCCC 1977, WCCC 1980, WCCC 1983 and WCCC 1986. In 1980 running on a PDP-11/70, since 1983 BCP was custom-build computer with a fast sequential logic controlled by a Zilog Z8000 16-bit micro computer. The program was written in C, Assembly, and Microcode, performing 20K Nodes per second (1983) [1].
Mate Search
In order to find mating sequences fast, BCP's Quiescence Search includes checks if and only if they have one (or no) reply [2]. The original intention of this rule was to detect some (relativly) frequent cased of mate in two, but Don Beal obsearved the search time only increased marginally when the depth limit was removed.Photos & Games
1983
1986
WCCC 1986, Round 2, Nona - BCP [6]Publications
External Links
Chess Program
Misc
References
What links here?
Up one Level