Author: John J. J. Smith
Date: 01:14:19 12/18/05
Go up one level in this thread
On December 18, 2005 at 03:51:33, Uri Blass wrote: >My idea is the following: > >decide that some weak program has rank 0. >Choose hardware and time control. > >play the Noomen match between every 2 programs(this match has 100 games). > >Every program that score more than 60% against the weak program that you choose >in the Noomen match is at least rank 1. > >If they cannot score more than 60% against programs with rank 1 they have >exactly rank 1. > >You can see that I defined the programs with rank 1 and the programs with rank >higher than 1. > >Suppose I defined the meaning of programs with rank n and programs with higher >ranking than n. >programs with rank n+1 are programs that scored more than 60% against at least 1 >program with rank n but did not score more than 60% against all the programs >with rank that is higher than n. > >Not that this definition is meaningful only if the ratio is transitive and we >need that to have that if A gets more than 60% against B and B gets more than >60% against C then C cannot get more than 60% against A. I think the potential problem is in the transitive assumption. If A beats B and B beats C it doesn't always follow that A beats C. Look at how well Ruffian is doing against Rybka.
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.