Author: James Swafford
Date: 05:27:44 09/13/02
Go up one level in this thread
On September 12, 2002 at 23:27:13, Brian Richardson wrote: >On September 12, 2002 at 22:56:12, James Swafford wrote: > >> >>I'm (still) working with my hash tables, and having quite a time >>with this one. I'm hoping someone can explain this behavior: >> >>1. In iteration 1, the search returns a score of 15 for move A. >>2. Naturally, the iteration 2 search begins with move A. The search >> window is set to +/- 1 pawn ==> -85, 115. (Yes, that's wide, >> but that's not the point. :) >>3. Move A again gets a score of 15 from the depth 2 search. >> The search continues, though, and root move B fails high. >> Move B is a move that leads to mate in 3 (half moves), so >> an extension was triggered (I don't think this is important). > >When storing the hashed result, do you hash store the depth when probed before >extensions? As of last week, I store the unextended depth. We probably made that fix the same day. :) <snip> -- James
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.