25,161
edits
Changes
no edit summary
With today's search depth this approach seems to be impractical, since the difference between the root and leaf position may be very big. There also might be a problem with re-using hash scores from the previous entries. About the only recent chess program that sticks with pre-processing for good or bad is [[RomiChess]] <ref>[https://www.stmintz.com/ccc/index.php?id=18203 Re: What is "pre-processing"] by [[Ulrich Türke]], [[CCC]], May 08, 1998</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=18213 Re: What is "pre-processing"] by [[Amir Ban]], [[CCC]], May 08, 1998</ref>.
=ExampleExamples= Material and piece-square tables alone are enough for a program to play a semi-decent game of chess. Indeed, [[Tomasz Michniewski]] advocated a method of testing requiring all the tested programs to have identical, simplistic evaluation function, so that only search and efficiency issues would influence the result. One such tournament has been carried out in Poland.[[Ronald Friederich]] improved this approach using [[Texel's Tuning Method|Texel's tuning method]] as applied in [[RofChade]] and [[PeSTO]].
* [[Simplified Evaluation Function]]
* [[PeSTO's Evaluation Function]]
=See also=
