Author: Joshua Haglund
Date: 14:22:15 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)?
I like to take stabs at topics even if I'm unaware of the topic.
The first way I can think of dealing with this is to clear the hash table and
continue with the search.
Second, how about making the hash table bigger.
Third, create a second hash table.
if (hash table = full) {
switch to table2}
else {
};return search
I hope this atleast humors you,
Joshua
toneewa@yahoo.com
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.