Author: Dan Honeycutt
Date: 11:05:13 08/05/04
Go up one level in this thread
On August 05, 2004 at 11:05:45, morphy wrote: >On August 05, 2004 at 10:56:32, Dan Honeycutt wrote: > >>On August 05, 2004 at 10:49:24, morphy wrote: >> >>>Why don't reserve always a little time for each branch of the tree in the tree >>>searching, insteat to truncate this branch if depth reduction is not necessary >>>for memory amount. How little must be this time would depending by the average >>>(and min/max) evaluation of that branch. Thanks at all. >> >>Not sure what you're asking, but depth of search does not depend on amount of >>memory. >> >>Dan H. > >Very well so if it depend only by time why don't reserve a little time for any >branch in the search? You normally allocate an amount of time and search as many branches as you can. You reserve time to use where needed - not necessarily for each branch. If the move you plan to play suddenly drops in score (a fail low) you may allocate more time to try to find something better. Dan H.
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.