Author: Robert Hyatt
Date: 13:55:05 08/06/99
Go up one level in this thread
On August 06, 1999 at 13:47:35, Brian McKinley wrote: >I am implementing a parallel search, and I have 2 questions for those who have >gone before me. > >1. If my parent thread has searched all moves at a ply and a child thread is >still searching, should the parent thread wait for the child thread to return, >or should it abort the search in the child thread and re-search the move from >the parent? This would allow the child thread to be placed back in the pool so >that both threads are working again. I am assuming that the re-search would be >fast to the point where there child was stopped. I don't.... I let the parent jump in and help the child it would be waiting on... In fact, all my threads work like this... they _never_ wait on someone to complete a search... when a thread runs out of work, it makes this globally known and any busy thread can say "come help me with what I am doing"... > >2. If a score comes back that is greater than alpha and less than beta and there >is a child thread searching another move for this ply, should I update beta in >the child thread? Am I correct in assuming that this is not an issue for MTDf? I did this in Cray Blitz (DTS algorithm). I don't do it in crafty as it is _very_ messy, because you have to stop to see if any position that was ok now causes a cutoff... It shouldn't be a problem in mtd(f). > > >-- Brian McKinley
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.