Jump to: navigation, search


No change in size, 15:10, 16 May 2018
no edit summary
==David Kittinger==
[[David Kittinger]] and [[Scott McDonald]] in 1984 on [[Piece-Square Tables#Preprocessing|Pre Scan Heuristics]] of the [[Super Constellation]] <ref>[[David Kittinger]] and [[Scott McDonald]] ('''1984'''). ''Report from the U.S. Open''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]] pp. 15-33</ref>
A second departure from other commercial programs has been the simplification of the [[Evaluation functionFunction|evaluation function]] as applied to the [[Leaf Node|end nodes]] of the tree [[Search|search]]. The programs instead rely heavily on specific chess [[Knowledge|knowledge]] which is concentrated into a special [[Piece-Square Tables#Preprocessing|preprocessor]] which interfaces to the tree search primarily through the [[Score|scores]] associated with specific ply-one [[Moves|moves]]. This ides of a ply-one move preprocessor was originally implemented in the program [[Tech]] by [[James Gillogly]] in the late 1960s. Although Tech only achieved a high 1400 rating running on a large computer, the strategy has certain appeal. First, chess tree searching has become very efficient, and second, the interaction problems associated with putting ever increasing amounts of chess knowledge in the tree become formidable. It has become apparent to that this rather simple approach might contain the structure of a master level microcomputer program.
==Peter Gillgasch==

Navigation menu