Author: Daniel Pineo
Date: 08:29:03 04/07/05
Go up one level in this thread
On April 06, 2005 at 19:58:17, Uri Blass wrote: >take a chess program. > >Your target is to find the difference in rating between the program and a >program that plays random moves. That's actually a good way to define an elo system that isn't strictly relative like the one we have now. IE define elo=0 to mean totally random play. Then define elo=1 to be the strength of a program that loses to elo=0 1 out of 10 times. Define elo=2 to lose to elo=1 1/10 of the time, etc. So the probability of player A losing to player B is 1 in 10^(eloA - eloB) Then no one would argue about whether a 2600 player of today could beat a 2600 player of the 1920's because playing strength is always be measured relative to the fundamental standard of random play. Dan Pineo
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.