Author: José Carlos
Date: 01:17:22 01/16/01
Go up one level in this thread
On January 15, 2001 at 22:19:03, Dann Corbit wrote: >On January 15, 2001 at 12:21:40, Jorge Pichard wrote: >[snip] >>PS: Can somebody explain why certain programs benefit more than others using a >>better computer. I also remember some post in reference to gandalf 4.32g >>benefiting by the use a system higher than 800 MHz. > >If a program has a better O(f(n)) algorithm, at some point it will dominate. Just in case someone does not know what this means: Suppose a car race with two cars. Car A acceletares very fast, but has a top speed of 100 mph. Car B needs much more time to accelerate, but it can get 150 mph. With little time, car A will get more distance than car B but, given enough time, B will pass A and win the race. José C. >With chess programs, it takes a lot of data to find out which program really is >stronger. This is especially true when the programs are close in strength. The >tournaments we run usually won't tell us nearly as much as we might think. I >just ran 1000+ matches at G/60 but you really can't tell which program is the >strongest even with that many games.
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.