Author: Don Dailey
Date: 09:10:44 09/30/98
Go up one level in this thread
>>Which is pretty much how I do it. But my main point actually was how >>one should THINK about null move selectivity. Thinking of it this way >>is a great simplification and can make it easier to understand. >> >>My program actually does a null move search with a zero width window >>around beta, so I don't actually get to raise alpha. In lots of testing >>I did this was more efficient, I don't know if anyone else has tried >>this or finds it useful. I also do my test at the top of the search >>like you do but after making the move passed to the search function. >> > > >My null-search is also with beta-1,beta as the window, because I only care >about failing high, and wouldn't trust the null-move to "raise alpha" in >those few cases where I am not already doing a null-window search in the >PVS code. Hi Bob, I have the same concern. There were a few positions that caused problems and since the zero window is fast, there seems to be no justification for having to put up with the alpha problem. - Don
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.