Author: Timothy J. Frohlick
Date: 14:13:34 01/27/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. Right on Tim, This is especially true when the 1 and 2 ply searches may be full-width and the 30 and 31 ply searches are always selective searches. We know that DB was thousands of times faster than any chess computers in the average home and it only managed to hold its' own against Kasparov. If the rating goes up linearly then DB should have had a rating of elo 3000+++ A speeding bullet is only as good as the person aiming it. Tim Frohlick
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.