Author: Nolan Denson
Date: 17:30:16 05/08/02
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 ??? 2. Which algorithm is considered best??? 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.