Author: Robert Hyatt
Date: 09:59:44 06/26/03
Go up one level in this thread
On June 26, 2003 at 08:58:06, Martin Bauer wrote: >Hi, > >I am thinking about the problems with hashing AND nullmove. Is there something >known to take care about? > >How about writing scores to the table in lines where some nullmoves are done? >Can I use this values later when a hashhit occours without any extra conditions? > >At the moment I use both without taking care about each other and I do not >notice big problems. But that's no proof, that there aren't any... > >Bye > >Martin All you have to be careful of is to record the _correct_ depth when you store any entry. Whether or not null-move searches occur farther down in the tree is irrelevant. If you reach this same position again, with the same depth remaining, you should do the _same_ null-move searches then as welll, so using this result makes perfect sense.
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.