Author: Robert Hyatt
Date: 14:10:26 09/04/03
Go up one level in this thread
On September 04, 2003 at 15:37:37, Gian-Carlo Pascutto wrote: >On September 04, 2003 at 11:00:41, Robert Hyatt wrote: > >>Maybe or maybe not. Neither of them splits at the root either, yet that is >>by _far_ the most efficient way to search in parallel, if you take care of a >>couple of special cases that I am handling. > >I hope Knuth & Moore didn't hear you, or the alpha-beta bogeyman is gonna >be out to get you tonight. > >-- >GCP Knuth and Moore _know_ that splitting at the root is the right thing to do. After you have searched the first move in parallel, of course... I do both.
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.