Author: Michel Langeveld
Date: 00:07:37 10/17/03
Go up one level in this thread
On October 16, 2003 at 14:13:56, Steve Maughan wrote: >Michel, > >>Do you mean with ignoring the depth: >>1) let the old possibly higher depth in the hashtable or >>2) always overwrite with the lowerdepth and ignore the depth already in the >>table > >Option 2 - always overwrite no matter what the depth is in the hash table if >there is a match with the current hash key and the one stored in the hash table. > >Let us know how you get on, > >Regards, > >Steve Always replace on different hash keys and replace on the same hashkey with higher depth made my program quicker and let it find the correct solution. But it is not as quick as when I just always replace with no futher conditions. I will try to make two hashtables this evening: - one always replace - one best replace I hope that it fixes this position and others.
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.