Author: William Bryant
Date: 19:51:25 06/23/00
Go up one level in this thread
On June 23, 2000 at 12:05:28, Bruce Moreland wrote: >Don't allow hash cutoffs so close to the root of the tree. > >bruce Bruce, I'm doing a repetition check prior to probing the hash table. (If a repetition is detected, then no probe is done). Also, no probing _at_ the root. But, I'm curious about this last statement. Do you require Ferrit to be at or beyond a certain depth before probing the hash table or before allowing a cutoff if present? William wbryant@ix.netcom.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.