Author: Dieter Buerssner
Date: 04:38:20 12/24/02
Go up one level in this thread
On December 24, 2002 at 04:11:44, Steve Maughan wrote: >I do prefer the exponential decay method - you can even express >the final score as a percentage. I not only thought about this exponential decay, I actually even implemented it, so that the score is given automatically. Unfortunately, I ran the wrong version´, and was too lazy to calculate. In the table I gave, you may have recognized, that the solution are given at some check points, where the time is more or less rising exponentially. So, I also want to be able to not only judge it linearily. (I deleted some colums, so they will fit on the page). I also thought about a good formula, where one can judge this by one value. I a calculate for example the sum of the logarithms of solution time. With your formula, a problem might be, that it has a time domain. Assume I change a version, and test again. All will be the same, but one solution time goes from 30 seconds to 60 seconds. This will lose about 2 points. Another solution goes from 480 to 180 seconds. This will gain about 1.2 points. My feeling would say, the later version is not worse, but with the given formula, it is. When just comparing the sum of the logarithms and the number of solutions stays the same, to me, the comparision would look more natural. In the example above, the later version would win. I see however, that your formula also has advantages. It handles the cases of different number of solutions better. To me it looks, like it would work best, when the typical solution times are not too far from the half-live time. Regards, Dieter
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.