Author: Jim Phillips
Date: 00:11:21 10/01/98
Go up one level in this thread
On October 01, 1998 at 01:59:11, John Coffey wrote: >On October 01, 1998 at 01:19:20, Jim Phillips wrote: > >>On September 29, 1998 at 21:02:06, Jim Phillips wrote: (snip snip snip...) >>I dug out that article when I got home and took a careful look at the >>graph. It's linear all the way from beginner up to 2000+ rating.... >>I assume it is for programs with a lot of knowledge, playing at 40/120 >>time control. I determined that a best-fit formula to duplicate the >>graph is: >> U.S. Chess Federation Rating = (200 x Ply Depth) + 550 >> (snip some more...) >>-Jim Phillips > > >It was common even in the old days for programs to have selective extensions. >(i.e. capture search.) for example, the Novag Super Constellation was at >1 ply a lot stronger than 750. It was more like 1300. So the question >becomes are we talking about the maximum ply a program can look at? > >john Coffey Hi John, My understanding is that it's for a full-width search with no extensions. I'm not certain on that though. Have any other CCC members seen a similar graph or formula? -Jim Phillips
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.