Author: Alvaro Polo
Date: 12:24:04 07/25/00
Go up one level in this thread
On July 25, 2000 at 06:23:51, Ralf Elvsén wrote: >On July 25, 2000 at 05:05:44, blass uri wrote: > >>> >>>Alvaro >> >>Your calculation is wrong because of diminishing return from speed. >> >>Uri > >Right or wrong belongs to pure mathematics. Here we need an estimation >of the uncertainty. If a result is in the right neighbourhood >it's usable. > >Ralf I am going to modify my "I am wrong" assessment. DBJ was making 750,000 nodes per search, and CT 375,000 nodes per search, but DBJ was using only 1 second and CT 22 secs per search. This difference compensates the weak CPU being used by CT. I hence believe that this is equivalent to DBJ against CT (under a powerful P3) if both were using the same time per search (DBJ using equal time compensates the P3-Pentium 150Mhz difference). Then the full DB, at 200Mnps rather than 750Knps would be about 560 Elo higher than CT on a modern machine, assuming that diminishing returns don't affect comp-comp matches, something, on the other hand, that has never been proven wrong. Alvaro
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.