25,161
edits
Changes
no edit summary
'''Delicate Brute''',<br/>
an experimental chess program by [[Don Beal]] written in [[C]], which participated at the [[ACM 1991]] and the [[WCCC 1992]], running on a [[Sun#4|Sun-4]] [https://en.wikipedia.org/wiki/Workstation workstation] and about 4K [[Nodes per Second|nodes per second]] in 1991, and at the WMCCC on a [[SPARCstation|Sun Sparc II]] with about 10K Nps <ref>[[Jaap van den Herik]], [[Bob Herschberg]] ('''1992'''). ''The 7th World Computer-Chess Championship. Report on the Tournament''. [[ICGA Journal#15_4|ICCA Journal, Vol. 15, No. 4]]</ref>. Apparently, Delicate Brute was a [[Brute-Force|brute-force]] approach enhanced by [[Selectivity|selectivity]] as introduced by [[Don Beal]] <ref>[[Don Beal]] ('''1986'''). ''Selective Search without Tears.'' [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]]</ref>,
such as using the [[Null Move Pruning#NMQS|Null Move|null move quiescence search]], a selective layer between a regular full width search and [[Quiescence Search|quiescence search]], later dubbed '''Generalized Quiescence Search''' <ref>[[Don Beal]] ('''1989'''). ''Experiments with the Null Move''. [[Advances in Computer Chess 5]], A revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1</ref>.
=ACM 1991=
