Author: Bob Durrett
Date: 16:08:21 12/05/02
Go up one level in this thread
On December 05, 2002 at 18:02:23, Robert Hyatt wrote: <snip> >The idea was to search multiple root moves in parallel. Of course you are >correct in that there is no way to really know anything without having done >it already. My approach (in annotating games) has been to search all moves and >get the best, then remove it from the set and search again to get second-best. >Repeat >until either tired or done. :) > <snip> Do you assert that there is no other approach? [a "loaded" question] Bob D.
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.