Author: Bruce Moreland
Date: 09:40:27 06/30/98
Go up one level in this thread
On June 30, 1998 at 09:24:00, Inmann Werner wrote: >Is my problem-analysis ok? Have I forgot something important or stupid? > >If not, what can I do? > >Should I write the "distance - number of extensions" when I write to the Hash >table? What follows then out of this!? As far as I can tell, the problem you are describing is this: You enter a node, look it up in the hash table, and if the stored node has enough depth, you cut off. *After* this, you check to see if you should search this to a greater distance than you had planned, and perhaps you extend. This causes problems because, if the first time through you plan to do a 6 ply search, but do a 7 ply search, and store a 7 in your hash table, next time through you will plan on doing a 7 ply search, and when you look it up in the hash table you'll see that you've already done it, so you'll cut off. Sound right? I think the solution here is to do your extensions before you hit the hash table, or store the depth from before you extended. This latter idea might have some problems if you extend a position sometimes, and don't extend it some other times, but these problems might not be noticeable. bruce
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.