Author: Dann Corbit
Date: 07:48:32 11/06/98
Go up one level in this thread
How well programs do is going to be a function of many factors. Fast searchers
are going to benefit more from hash tables than programs which try to integrate
more knowlege into the search. Time controls can change greatly the way a
program plays. For instance, if you have a superior fundamental algorithm, at
some point of long time control, you will out-perform a program with inferior
algorithms. As an illustration, imagine a sorting program that does an
insertion sort in assembly and is very well hand optimized. For small data sets
it may out-perform a clumsy radix sort written in BASIC. But when the data set
gets large enough, the radix sort will have to win because the fundamental
algorithm is O(n) {linear} whereas insertion sort is O(n^2) {parabolic}.
It is also possible that a certain program will run especially well on a
different chip, for some particular time controls.
Memory is cheap now-days. You can probably get it for a little more than $1 per
meg. So if you want greasy fast performance, you can get a cpu with a nice
primary cache, a bus that moves 64 bits in a pop, and tons of high speed ram.
It's not as expensive as it used to be.
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.