Author: Georg v. Zimmermann
Date: 02:22:12 05/28/02
Go up one level in this thread
>Oh, remembered what the problem was - the extensions! >I also need to put a limit on the number of extended plies. >So the margin should be: 1 ply per piece (for the qsearch) -2 for kings and added to that the >maximum extension depth. Last one is a limit many programs has, not a bad idea >either, for searching 60 plies there could be many checks (which is also why I >saw one case of depth 71, no way qsearch could go 11 plies with just two pawns). The problem here is that you set the memory for your arrays at startup. And there you have to expect say highest search depth 40+ 30 pieces quiesce + 40 extensions. I am no low level expert. But loads of arrays[110] must make it slower because these are memory regions in between that are almost never used. > >If the number of estimated pieces is not sat too low, then this should be >foolprof, right? Chess program and foolproof ? oh my :) 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.