Author: Sune Fischer
Date: 06:15:40 05/27/02
Go up one level in this thread
On May 27, 2002 at 08:51:04, Georg v. Zimmermann wrote: > >>It seems better both with respect to speed and accuracy to deal with this >>problem at the root, if possible. > >I think its impossible. Your safety-margin idea doesnt really work because the >point of a qsearch termination is indeterminable (nice pun huh). hehe yeah, but you don't go 60 plies when there are more than just a few pieces (at least I can't think of such a position), few pieces should give a very shallow qsearch well within the 15 plies or 20 or whatever margin one chooses. -S. >>After all, scores probably don't change much from a 45 ply search to a 60 ply >>search (theoreticly), but the strange scores you get around ply 60 by cutting >>may change the scores all the way up the tree, I don't know. >> >>Perhaps the best would be to completely remove the depth limit and just let it >>go as deep as it can in the given timeframe? > >That doesnt work either. Or all your arrays that hold takeBack Information for >example get far oversized. > >Georg
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.