Author: Robert Hyatt
Date: 08:14:56 08/26/05
Go up one level in this thread
On August 26, 2005 at 03:22:46, Andreas Guettinger wrote: >On August 25, 2005 at 14:44:53, Robert Hyatt wrote: > >> >> >>Of course that is true. A crappy search, twice as fast, is just twice as >>crappy. So "decent program" is a given before considering a parallel search >>implementation. Although an experienced programmer would probably want to >>design in the capability for parallel search from the ground-up, as it is far >>easier than stuffing it in way later in the development... > >And what would be the key points in a "design in the capability for parallel >search"? >The organisation of data structures? > >regards >Andy For one thing, yes. Also global data and how it is used or modified. And then the basic Search() implementation and how a node in the tree might be split up and searched in parallel with minimal changes to the basic code.
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.