Author: Steven Edwards
Date: 16:53:55 05/19/04
Go up one level in this thread
On May 13, 2004 at 22:41:03, Dan Ellwein wrote: ><<snip>> > >The fast and nominal limits are checked in the top level CandidateSelector KS >that manages the root effort parameter generation. Combined with a certainty >metric and records of usage for previous effort values, CandidateSelector >performs some magic and decides on whether to end the selection process or to >continue it with a higher effort. The hard limit is checked by the KS Manager >and it will end the search gracefully if and when the hard limit is exceeded. > ><<snip>> > >Hi Steven > >this magic that CandidateSelector performs > >on deciding to end/continue the selection process > >can you explain this a little better... if (certain score) exit if (out of time) exit if (a little time left) try another plan [if available] at ply 0 if (a lot of time left) try a global re-search with a greater effort Plus some magic dealing with uncertainty vs. remaining time
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.