Author: KarinsDad
Date: 15:20:52 03/13/00
Go up one level in this thread
On March 06, 2000 at 11:46:38, Jay Scott wrote: [snip] In a real >game a program can try to reach positions that it knows how to play well, >but in a suite it has to take what comes. Is this really true? And if so, is it an accidental result based on the search engine (i.e. the search engine picks what it considers to be strong moves, hence, the positions arrived at correspond to moves selected by the engine)? A self fulfilling prophesy type of argument. Or is it an intentional result (i.e. the search engine avoids positions that are unclear and hence, only picks positions that are reasonably clear to the program)? I can imagine this for the opening since the programmer can steer the opening book clear of positions which the program plays badly on, but does it really apply to the middlegame and endgame positions? I would think that there is a major difference between understood positions and calculatable positions. It would seem that the programs are not sophisticated enough to "try to reach positions that it knows how to play well" with the exception of opening moves. KarinsDad :)
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.