Author: Graham Laight
Date: 03:26:58 10/20/99
Go up one level in this thread
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) 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 C1 = 1.5 C2 = 4300 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 Graham On October 19, 1999 at 10:35:32, Jeremiah Penery wrote: >On October 19, 1999 at 10:30:18, rich buska wrote: > >>i understand that is a 1/2 move but what does equal in elo >> >>2 ply 1100 ? >>4 ply 1400 ? >>6 ply 1600? >>8 ply 1800? etc? > >I don't think you can say for sure. A lot of it depends on the quality of the >static evaluation within the individual program. A program with a very simple >evaluation (Fritz, maybe) will do much worse with 2 ply than a program with a >larger evaluation (Hiarcs, CM, Rebel, Crafty, etc.) doing a 2 ply search. The >way Fritz (or other programs) can make up for this is with extensions, which >will greatly influence this. The more extensions done (in lower search depths), >the better the program will play. [Because in higher search depths, too many >extensions can stall the search, and make it play much worse, even.] > >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.