Author: Gian-Carlo Pascutto
Date: 14:48:19 09/04/02
Go up one level in this thread
On September 04, 2002 at 15:01:55, Robert Hyatt wrote: >On September 04, 2002 at 14:49:53, Vincent Diepeveen wrote: > >>On September 04, 2002 at 14:24:47, Robert Hyatt wrote: >> >>With YOUR method it is very easily possible to get always >>> 2.0. >> >>The easy case is a program that gets a speedup of about 1.9 >>and profits just a bit more than 5% from a filled hashtable. >> >>That's by definition > 2.0 then. > >No, that is by hand-waving > 2.0. Because the serial search would >_also_ profit by the filled hash table and run faster. > >Try again... The problem is that one position influences the other. They are not independent measurements, but your article is based on the fact they are. -- 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.