Author: Robert Hyatt
Date: 10:32:19 07/09/02
Go up one level in this thread
On July 09, 2002 at 12:09:42, Georg v. Zimmermann wrote: >On July 09, 2002 at 11:55:23, Robert Hyatt wrote: > >>On July 09, 2002 at 11:18:05, Patrik wrote: >> >>>Is there any reason not to use transposition table in root node? >>>Crafty does not use it in root node. >> >> >>What would it give you? IE you probe before you search. > >Yes, but I have info from the *last search* and that gives me a good estimate >for the null window and a good move to search first. It also tells me how deep I >have searched this position before so that I dont need to start the iterative >deepening with depth 1. This is not what he is asking. He is asking about probing the hash table at ply=1 specifically. Not prior to starting a search of any kind. Those are two different issues. I don't use the hash table to establish the PVS window, I simply compute it after I complete an iteration just before I start the next iteration. And I know I don't want to start over at iteration 1 there, I want iteration N+1 since I just completed N. > >Greetings, > >Georg
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.