Author: Robert Hyatt
Date: 20:29:27 01/06/04
Go up one level in this thread
On January 06, 2004 at 12:49:05, Steve Maughan wrote: >Zach, > >Interesting - is there an PDF file I can download with this info? > >>The way Hsu described it was along the PV, > >i.e. where beta > alpha + 1 in a PVS search > >>you search all moves like normal, and >>you have two values containing the best and second best scores, and after all >>moves are searched, if the best score is more than the second by a certain >>margin, then research the best move with a deeper depth. > >even when the bestscore <= alpha? Surely not when bestscore >= beta? He defined SE for PV and CUT nodes. IE the nodes where you search for a true score, and the nodes where you hope one move only will fail high and produce a quick cutoff. ALL nodes have no useful SE definition. > >Regards, > >Steve
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.