Author: morphy
Date: 08:05:45 08/05/04
Go up one level in this thread
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?
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.