Author: walter irvin
Date: 10:33:08 01/28/00
Go up one level in this thread
On January 27, 2000 at 15:33:44, Tim Mirabile wrote: >On January 27, 2000 at 02:45:39, Jeremiah Penery wrote: > >>First, a postulate: Any increase in *search depth* will correlate to a ratings >>increase. I believe this to be a fairly linear curve. This will never give >>diminishing returns. > >This is a very big assumption right there. Hard to believe that the rating >difference between a pair of programs searching one ply vs two ply will give the >same rating difference as programs searching nine vs ten ply and as programs >searching 30 vs 31 ply. the point you make here is a very big point ,people seem to miss this . i believe the difference between 30 and 31 ply would be almost zero .
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.