Author: Robert Hyatt
Date: 14:30:23 12/19/02
Go up one level in this thread
On December 19, 2002 at 16:50:32, Dann Corbit wrote: >Suppose that we are searching at long time control, and the hash table rapidly >fills up. This can throw move ordering in the toilet, if we can't find >transpositions any more. > >What sort of replacement scheme is best for very long searches (several >minutes)? The best you can do. The two-table approach is one example, as you will _always_ store a position somewhere, even though it overwrites something else. One possible idea (which I use) is to simply not hash in the q-search, which eliminates at _least_ 1/2 of the total nodes from being stored at all...
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.