Author: Sune Fischer
Date: 09:29:44 11/19/02
Go up one level in this thread
On November 19, 2002 at 11:44:07, Robert Hyatt wrote: >I don't follow your math. If I do a 9 ply search (assuming no extensions here) >I don't ever >probe at ply=1 as that is useless, but I do probe at plies 2 through 9. How do you know it is useless, what if you have done a 15 ply search two moves (real moves) earlier, and the pv was correct? You might still have a useful 13 ply result in the hash, perhaps an exact matescore. >I don't >see how my last >ply is "not a full ply" as I do everything at the last ply that I do at every >_other_ ply in the >full search.. I don't follow that; just before going off to qsearch you makemove() and do some extensions, then you go to qsearch. There is no repetition detection or egtb probes or anything as far as I can tell, so I don't see how it can be a normal ply. >>>Ditto for search extensions as they occur right after MakeMove() is called, >>>prior >>>to the recursive call to Search or Quiesce... >> >>I counted 6 calles to Quiesce() in Search() (Crafty 18.15), I need only 1 call >>:) > > >Are you doing (a) internal iterative deepening? no (b) null-move search? yes >those >account >for three distinct calls. (c) PVS? on and off, I can't figure out if it works for me, I get more nodes every other ply and as a principle I don't like to destroy the only real good information there is: the alpha and beta values. >that requires three overall. One for the >first move, >Potentially two for any move but the first, since the null-window search can >fail high >and it must be re-searched. > >None of those are "repeated" or "duplicates"... I have several Search() calls, but only one Quiesce() like I only have one Eval() and only one IsDraw(). -S.
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.