Author: Álvaro Begué
Date: 20:14:59 12/20/05
Go up one level in this thread
On December 20, 2005 at 21:25:25, John Merlino wrote: >[...] > >Given such a huge difference in score, I would begin to suspect a bug in Rybka's >implementation of "sd=1". > >I find it hard to believe that Rybka's evaluation (which is all that is being >tested here, since the entire search algorithm should be rendered useless with >"sd=1") can solely account for an increase in 400 ELO over Zappa, Shredder, et. >al. Actually, sd=1 still performs a quiescence search for each move. It could be the case that Rybka considers some more moves as part of the quiescence search, or that it uses a very different type of quiescence search, like the null-move quiescence search that Don Beal proposed in his thesis. Then again, it may just be some code saying "always search at least to depth 4, no matter what the conditions specified by the GUI". Álvaro.
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.