Author: Tim Mirabile
Date: 12:33:44 01/27/00
Go up one level in this thread
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.
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.