Author: Russell Reagan
Date: 14:48:57 08/28/03
Go up one level in this thread
On August 28, 2003 at 17:42:56, Gian-Carlo Pascutto wrote: >If the base programs aren't the same, which they aren't in the above example, >I can give a simple example: an engine with material only eval will be defeated >by an engine with an extensive evaluation function but no forward pruning >(or transposition tables), for example. So a material only engine with transposition table and forward pruning would be weaker than one with an extensive evaluation function, but no transposition table and no forward pruning? Hmm, I can see that, because you'll have a log jam of "best moves" most of the time so you'll play a (more or less) random move that doesn't lose material. What about the same scenario, but substitute piece square tables for material only? I think the program with TT and forward pruning becomes stronger then.
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.