Author: Dan Andersson
Date: 04:13:06 01/11/02
Go up one level in this thread
It seems to me that you believe that the curresnt state of search is near optimum. I find this view a tad silly. Newer research exploiting graph properties of the search space shows that current search is much to large. And add to that safe and semi-safe pruning methods. And I really can't see that improving search has a hard limit, except for the 'perfect evaluator'. You seem hopelessly stuck in the 'knowledge pidgeonhole'. Most improvements in search are of a geometrical nature, thoug they may incur some overhead. So it seems obvious that search should be at least as important as evaluation. And less error-prone. MvH Dan Andersson
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.