Author: Eric Oldre
Date: 18:26:29 11/29/05
I was examining the endgame evaluation functions of fruit (2.1) and I had some questions. I like how fruit examines different combinations of material and can in certain cases say that this is a draw for sure, or in other cases go into deeper heuristics to discover the draw (or win?). As far as i can tell it is doing all this without precomputed bitbases. Since I certainly don't want to just copy the exact algorithms that Fruit uses for each case, I'd like to learn more about some of these basic endgames. Does anyone have links, or good book recommendations they recommend for some of this stuff? For example, how to evaluate KBKP, KPBKP, etc? Thanks for any help you might have. Eric
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.