Author: Vincent Diepeveen
Date: 15:12:29 04/22/01
Go up one level in this thread
On April 22, 2001 at 07:48:58, Frank Schneider wrote: >Hi, > >Gromit uses the standard PVS and sometimes after (e.g.) a fail-high >it only gets very short PVs. The reason is that after searching > >failhighscore = -pvs(-beta, -alpha); // returns failhighscore >= beta > >the research is done with > >realscore = -pvs(-infinite, -failhighscore); > >This search may return realscore == failhighscore and in this case >the PV is not saved, because the score is not inside the searchwindow. > >Of course it would be possible to do the research with a window of >(-infinite, -(failhighscore-1)), but this needs slightly more nodes. > >How do others ensure to get "good" PVs? > >Frank I always get PVs out of hashtable. I don't keep track of it during search. See no reason for it. Getting pv's out of hash works fine here.
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.