Author: Dann Corbit
Date: 11:52:17 01/28/00
Go up one level in this thread
On January 28, 2000 at 13:33:08, walter irvin wrote: >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 . WHY do you believe this? What measurements have you taken? By what line of reasoning do you arrive at this conclusion? I believe that there is about a 15% chance that the move found on the 31st ply would be different and better than the move on the 30th ply. This is based on the experiments of Heinz and Hyatt. It is extrapolation beyond the measured data and therefore very much in doubt. I believe that (according to measurements) beyond a certain depth where there is a big payoff for subsequent plies, all additional plies are worth about the same: a 15% or so chance of choosing a better move.
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.