Author: J. Wesley Cleveland
Date: 12:56:19 06/11/02
Go up one level in this thread
On June 11, 2002 at 11:52:47, Robert Hyatt wrote: >On June 10, 2002 at 18:45:03, Dieter Buerssner wrote: > >>I'd like to add, that not for all engines, it is some sort of luck, when they >>remember past analysis, and when not. I am convinced, that for my engine, it is >>better in general, to analyze from back to front. I am also convinced, that it >>will not forget previous analysis. >> >>Regards, >>Dieter > > >It _must_ unless you have a hash table of infinite size... If crafty stored the result returned from the prior search in the hash table, made the age current when the hash table returns a valid score, and started ply 1 with the move in the game, it would always get the most useful value and nearly always get the very useful values.
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.