Author: Bob Durrett
Date: 08:51:12 11/18/00
The idea of "guiding" the tree search is very interesting. During the "tree search" process, decisions must be made by the program [according to other posts which have appeared here] in order to determine which branch to pursue further and which branches to discontinue looking at. How is this done? One possibility is by somehow using position evaluation at each new position occurring in the branch. This seems to be the direct approach. Are there other ways? [currently in use or possible for the future] Expecially interesting is the question: How "smart" is the software in this regard? One can conceive of "simple minded" guidance and of "really brilliant" very smart guidance. Also, what kinds of software would be needed for making "smart" guidance decisions?
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.