Author: Robert Hyatt
Date: 07:12:22 08/08/01
Go up one level in this thread
On August 08, 2001 at 10:08:07, Robert Hyatt wrote: One thing to remember... this is really something that is designed to handle an under-sized transposition table. If the other side will get a hash hit, then your side should have already gotten one, unless it was overwritten. One thing that I think made this work less effectively for Crafty is that I don't hash the q-search nodes at all, which means I don't overwrite the hash table nearly so often as a program that does hash in the q-search. That is just a guess as to why it didn't do anything for me...
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.