Author: Vincent Diepeveen
Date: 18:51:48 06/13/98
Go up one level in this thread
On June 13, 1998 at 14:28:35, Robert Hyatt wrote: >this is as I described it I believe... except that if you use PVS you >can't make the test above, since you either get X or X+1 back from >the null-move, where X won't cut it. To make it work, I simply did a >second null-move search with a much lower window, and if it failed low, >I triggered the extension, producing the same effect as above, but >within >the PVS alpha,alpha+1 framework... Bob you're completely right, we need to waste more nodes when using this algorithm, and with my selective way of bound searching i can't afford that either. > >> } >> } >> >>//////////////////////////////////////////////////////////////////////// >> >>=Ernst=
This page took 0.01 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.