Author: Robert Hyatt
Date: 15:08:37 10/04/01
Go up one level in this thread
On October 04, 2001 at 00:44:55, Uri Blass wrote: > >It is not useless because you may learn from it to improve the sequential >algorithm. > >It is also possible that the programmer only cares about using more than one >processor and in that case (s)he is not going to waste time about improving the >sequential search. > >Uri I don't buy that last comment. IE I spend a _lot_ of time improving my sequential search. Because it is the _exact_ same search I use in the parallel version. And I know that any improvement done in the sequential search will also benefit the parallel version. The threading code is 100% independent of the alpha/beta search code. You could spend years fiddling with how you thread, where you break things up, what kinds of updates you do across threads, etc... without touching one line of the base alpha/beta stuff. You could also spend years fiddling with the alpha/beta search stuff and never touch the threading code either. They are totally independent of each other.
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.