Author: Robert Hyatt
Date: 08:20:24 11/10/02
Go up one level in this thread
On November 10, 2002 at 03:38:46, scott farrell wrote: >I know that is a bit of an oxymoron, but I need somewhere simple to start. > >Parallel chess doesnt seem to be documented as clearly as say other chess >programming topics. > >I know its not the smartest, but is APHID still considered simple? > >I want something that I can start simply, get something to work, and do more >detailed work on later. aphid (and others) is ok. But that is not where you start. That is how you implement things once you have designed how your parallel search is going to work. The simplest parallel search to implement (which will actually work decently and provide reasonable speedup with 2-4 processors) is called the PVS search (not to be confused with the PVS search where all but the first branch from a node are searched with a null-window.) I have explained it in another post elsewhere. If you want more details, feel free to ask...
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.