Computer Chess Club Archives




Subject: Re: Proving something is better

Author: Dieter Buerssner

Date: 14:22:35 12/19/02

Go up one level in this thread

On December 19, 2002 at 02:35:47, Bruce Moreland wrote:

>Match result math is rarely if ever done in the computer chess field.  Figuring
>out how to do this would be a *great* JICGA article, and it's amazing that
>nobody has felt the need to do this until now.  Being able to make positive
>statements about match scores would be worth something, you'd think, but 40
>years into computer chess research nobody has published this.

Rémi Coulomb has written an article (probably unpublished in any Journal). It is
available from his home page:

I have posted some code here, that gives some statistics about match results (on
a much more primitive level, based on Monte Carlo simulation).


This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.