Author: Charles L. Williams
Date: 08:26:56 06/11/99
Go up one level in this thread
On June 11, 1999 at 10:15:19, Torstein Hall wrote: >Its known that Fritz and some other fast programs reach their high nps because >they do their evaluation mainly at the start of the search. > >Is it not possible to mix this up a bit. So that you do a "big eval" at the >start, then at certain depths in the search. Or even better, if some condition >sets in, like swap of queeen, endgame etc, then do a new thorough eval, else >just the fast eval? > >But perhaps some programs do it that way already? Or perhaps its just not >possible to implement? > > >Torstein If there were a function called BigEval() that was executed without a search, then it seems like BigEval() would be better still when implemented with a search. Maybe BigEval() could be put to good use by pruning useless branches. Chuck
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.