Author: Robert Hyatt
Date: 14:44:24 09/23/98
Go up one level in this thread
On September 23, 1998 at 17:20:24, John Coffey wrote: >If you do a null move search, do the results for the null move get hashed? >i.e. you might reach this position again and want to use those results again? > >Thanks for all the resposnes, > >John Coffey Directly? No. IE whether the null-move search fails high or not, I don't specifically enter a note in the hash table here. But since the search below the null-move is just a normal search (but with reduced depth) the results of *that* search will certainly be hashed, as are all such searches. So, if I try a null move in this position when it is reached by transposition, I may well get a hit when I recursively call Search() to compute a value here. But I don't do anything special about storing "a null move search here failed high", because I can discover this next time without too much extra work anyway.
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.