Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Schaeffer, Long-range planning in computer chess, 1983

Author: Steven Edwards

Date: 14:08:04 05/25/05

Go up one level in this thread


On May 25, 2005 at 14:45:12, Michael Yee wrote:

>Thanks for the explanations. I think Schaeffer's approach at least included the
>ability to detect when the root plan was no longer valid for a given branch (in
>which case the rest of that branch would be treated in the standard no-plan
>way). But the ability of symbolic and paradise to re-plan at any node sounds
>much more flexible and realistic.

I should also point out that David Kittenger has also used root preprocessing
(e.g., Novag Super Constellation) in a manner somewhat similar to Schaeffer's
approach.  And, themantic analysis was also used in the Church and Church single
ply speed program ca. 1976.

I am just getting to the point in Symbolic where the theme list is used to
elaborate a BestMove goal.  Unlike at least some themantic programs, multiple
themes may be generated and elaborated instead of betting the farm on picking
the right theme first time, every time.



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.