Author: Robert Hyatt
Date: 07:25:15 05/09/02
Go up one level in this thread
On May 08, 2002 at 20:30:16, Nolan Denson wrote: >I was wondering which parallel search method is best. Some earlier posted the >info for me about which crafty was the first to use SMP ... (that version was >15.0 ) Now after looking into it the note states it uses the "PVS" algorithm >(Principal Variation Search). Now i know that Amy uses ABDADA as a parallel >search algorithm. So my ??? is > >1. Which algorithm is Crafty using today ??? A form of PVS, which is also a form of Young Brothers Wait. But it is not quite either of these since PVS has a rather severe limit where all processors search at a single node together and wait until everyone finishes before continuing at a shallower node... > >2. Which algorithm is considered best??? I don't believe that a decent implementation of PVS can be beat. From either a theoretical or a practical point of view... > >3. What are some other algorithms thats are being used by some other dual > programs??? > >Anyone feel free to answer. > >Thanks > >Nolan Denson
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.