Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: ply search vs elo rating - proposed formula

Author: Jeremiah Penery

Date: 07:16:12 10/20/99

Go up one level in this thread


On October 20, 1999 at 06:26:58, Graham Laight wrote:

>On the basis of what I have read in these threads, I propose the following
>formula for the relationship between ply depth and elo rating:
>
>log((ply * K) + C1) * C2
>
>Where ply = depth to which the search is 100% complete
>K = Knowledge level of program
>C1 and C2 are constants
>
>K is calculated as follows:
>
>If T is the total of all chess knowledge, and KP is the knowledge level of the
>program, then K = KP/(T - KP)


K and KP are both equal to the knowledge level of the program?  How do you
determine KP?  Is T equal to 1?


>Needless to say, the formula does not take account of search extensions (except
>that you can adjust the knowledge rating according to the cleverness of the
>extensions).
>
>I name this formula "Laight's Equation - 20/10/99"


:))

>To illustrate the formula in action, I will use the following values:
>
>K = 0.15


Is this a low-knowledge program?


>C1 = 1.5
>C2 = 4300


What made you pick these numbers?


>This would yield the following results:
>
>Ply     Elo Rating
>===     ==========
>
>2       1098
>4       1386
>6       1635
>8       1855
>10      2052
>12      2230
>14      2392
>16      2542
>18      2680
>20      2809
>22      2929


That looks quite interesting, and probably quite accurate. :)  The only things I
wonder are how you got the C1 and C2 values, and exactly what K=0.15 means.

Jeremiah



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.