Author: Robert Hyatt
Date: 12:03:00 09/03/03
Go up one level in this thread
On September 03, 2003 at 14:20:51, Gian-Carlo Pascutto wrote: >On September 03, 2003 at 14:02:44, Robert Hyatt wrote: > >>I assume he was talking about going from 2 to 4 giving zero. :) >> >>However, the example was real. In 1983 ... > ^^^^ > IIII > >Emphasis placed. > >If you manage to get at least 1.5 average speedup, in a modern >program, by only splitting the root, your program has SOME VERY SERIOUS >ISSUES. > Why? Spliting at the root _will_ produce a speedup. The theoretical proof is not hard to understand. Whether it is 1.5 or 1.3 is irrelevant. Vincent said "it can't be done in under a year." Splitting at the root is a _trivial_ algorithm to implement. It _will_ produce a speedup. Hence (again) his statement is wrong. That was the point, not whether the actual number is 1.5 or even 1.01. He said "less than 1.0" >-- >GCP
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.