Author: Rémi Coulom
Date: 01:10:35 12/20/02
Go up one level in this thread
On December 19, 2002 at 19:28:01, Peter Fendrich wrote: > >I did, some 15-20 years ago, in the Swedish "PLY" a couple of articles that >later became the basics for the SSDF testing. >A year or so ago you posted a question about how to interpret results with very >few games. In a another thread I posted a new theory for this as an answer >"Match results - a complete(!) theory (long)". >I also made a program to use for this that can be found at Dann's ftp site. >/Peter Hi Peter, If you had not noticed it, you can take a look at a similar program I have implemented: http://remi.coulom.free.fr/WhoIsBest.zip Basically, I started with the same theory as you did, but I went a bit farther in the calculations. In particular, I proved that the result does not depend on the number of draws, which is intuitively obvious once you really think about it. I also found a more efficient way to estimate the result. I checked the results of my program against yours and found that they agree. Rémi
This page took 0.01 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.