Author: Dann Corbit
Date: 18:33:40 09/05/02
Go up one level in this thread
On September 05, 2002 at 21:29:09, martin fierz wrote: >On September 05, 2002 at 21:18:42, Slater Wold wrote: > >>Any comments/thoughts/ideas/suggestions welcome. > >great stuff slater! >what i'd like to see is not only an average speedup (defined as time ratio, not >nps ratio - i think that time ratio is what counts) as you give, but rather a >list of all 300 speedups you observed, so we can see how the values are >distributed (you gave 2 extreme examples) - or you can just give us the standard >error on the speedup. what would also be interesting is if you reran the 2 CPU >test (maybe more than once....), and recomputed the average, and looked how >variable the average speedup is over such a large number of test positions. i'd >think that at least the average should be fairly stable, but even that seems to >be unclear... By what means are you limiting the search? Did you set time in seconds or depth in plies or what? It will make a very big difference on how we might interpret the results. Hash tables can share hits and mask speedup. Timed searches can suffer from the same effect. Depth in ply searches are probably the most reliable comparisons, but it is impossible to know which ply level is sensible since some problems may take weeks to reach ten plies and others may reach 32 plies in a few seconds. In short, the real difficulty here is designing the experiment. Quite frankly, I don't know the best way to proceed.
This page took 0.01 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.