Author: Mikael Bäckman
Date: 09:41:27 10/16/03
Go up one level in this thread
On October 16, 2003 at 11:17:54, Michel Langeveld wrote: >On October 16, 2003 at 09:41:48, Steve Maughan wrote: > >>On suggestion would be to do depth replace everywhere except where overwriting >>the same position, in which case always replace - i.e. if you find the position >>in the table already always replace it with the latest version / bound, ignoring >>the depth. Amir Ban suggested that this may work well for positions such as >>Fine 70. It is not obviously intuative but it may work since the value of the >>bound / score will be more relevant to to the current subtree. >> >>Anyway worth a try >> >>Regards, >> >>Steve > >Thanks for the advice! > >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 1) would be really not intuative. Hi Michel! I tried this. I changed my hash to always overwrite if the current hashkey and the key in hashtable match. I gained 14 plies on a 5 second search! :-) /Mikael
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.