Author: Robert Hyatt
Date: 08:34:07 12/08/03
Go up one level in this thread
On December 08, 2003 at 11:02:22, Alvaro Jose Povoa Cardoso wrote: > >I've been thinking about the efficiency of the history heuristic at high search >depths. >It seems to me that the history table will be overwritten many times if we have >a search of several billions of nodes. Additionally, as the search moves to >different parts of the tree the history table values will be somewhat trashed. >What do you think we could do about this? >Maybe limit the history heuristic to a certain depth (ex: the nominal depth). > >Comments anyone? > >Regards, >Alvaro Cardoso Things can't be "trashed". But the basic idea is to use the history heuristic as a sort of "super-killer" idea. If a move is good in one part of the tree, chances are it is good somewhere else as well. And the history stuff transplants such good moves from one place to another.
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.