Author: Jeremiah Penery
Date: 23:10:56 04/23/00
Go up one level in this thread
On April 24, 2000 at 00:42:47, Christophe Theron wrote: >I think we can say that a given amount of knowledge (without taking search into >account) gives you X elo points. Then the search (actually the depth of the >search) gives you Y additional elo points. > >For a given program, X is fixed and does not depend of the time control. Y >depends on the speed of the computer and the search time. I know of at least one specific case where X is not fixed relative to the time control. The knowledge is often tied in with the search - i.e., You may have some evaluation parameters that only affect low-depth searches, and some that don't actually do anything until you reach much higher depths. The one specific example is from the testing of Cray Blitz. He added some knowledge that helped the program while playing at very short time controls (Or, a much slower machine.), but totally ruined the program when it searched deeper. I don't think you can say X is necessarily fixed for every program, because there are always things you may put in to fix problems you see on your machine, but if you run on much slower/faster machines, that 'fix' may really break more than it fixes. Because it's all dependent on the dynamics of the search.
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.