Author: Roy Eassa
Date: 07:18:00 01/16/01
Go up one level in this thread
On January 16, 2001 at 04:17:22, José Carlos wrote: >On January 15, 2001 at 22:19:03, Dann Corbit wrote: > >>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. > So there really ARE programs that do proportionally better given longer time controls and/or faster CPUs than other programs (which do proportionally better with shorter time controls and/or slower CPUs)? Despite Christophe's many protestations to the contrary?
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.