Author: Robert Hyatt
Date: 07:29:30 05/09/02
Go up one level in this thread
On May 08, 2002 at 20:48:13, Jeremiah Penery wrote: >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 > >PVS is not a parallel algorithm. Actually it is. PVS is "overloaded". The first parallel search paper mentions this algorithm and a simple form is to search (serially) to a specific depth, then search in parallel until that node is completed, then back up one ply and search in parallel until that node is completed, continuing until you back up to the root and search the remaining moves there in parallel... It is one of those unfortunate acronyms that has two totally different and distinct meanings depending on whether you are talking about a parallel or a serial search. In Crafty's case, I use PVS twice. The serial PVS search as well as the parallel search.
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.