Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Symbolic: Search, planning, and a prospective

Author: Steven Edwards

Date: 03:41:56 03/16/04

Go up one level in this thread


On March 16, 2004 at 06:31:58, Sune Fischer wrote:
>On March 15, 2004 at 18:44:39, Steven Edwards wrote:
>>On March 15, 2004 at 05:48:05, Sune Fischer wrote:
>>>On March 15, 2004 at 05:06:09, Steven Edwards wrote:
>>
>>>Wouldn't it be possible to construct a simple testbed to quickly try out a few
>>>of the ideas and see if they have merrit?
>>
>>No.  There is too much foundation work needed to get even a simple plann
>>exercise to work.
>
>It should be possible to pick a position, analyze the kind of features that is
>needed to find the best move and try it out.

No. There are two different flavors of programming here:

1. Assembling the entire pattern and planning framework.

2. Building the pattern/plan library.

Item #1 is an all or nothing proposition.  Only item #2 can be done
incrementally.



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.