Author: Tom Kerrigan
Date: 00:38:33 05/30/00
Go up one level in this thread
On May 30, 2000 at 03:27:30, Steve Maughan wrote: >Tom, > >That is helpful - thanks! > >One more question; I assume that you really need to extract the PV from the >hash table as any one thread will only have searched a fraction of the PV's I've worried about this slightly but it doesn't seem to be a big deal. All of the threads seem to end up with a useful PV somehow (in my program, anyway). >tree? Also, suppose that you interrupt the search and force a move - which >thread would you use, since even at the root the threads could have different >alpha values and best moves. I assume that this would mean that it is even more >desirable to let all the threads complete a given search ply before playing a >move. My threads all seem to finish a search within a second of each other (and usually much less), even if it's a really long search. I think this is a property of the algorithm; if one thread is still searching, the other threads should be helping it. Unless there's some sort of hash table weirdness... -Tom
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.