Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Never Say "Impossible"

Author: Dann Corbit

Date: 10:34:42 05/04/01

Go up one level in this thread


On May 04, 2001 at 04:39:58, Graham Laight wrote:
[snip]
>This might not be achieved mathematically, and it might not be achieved by game
>tree search - but there is a third way: it could possibly be achieved by
>generating sufficient chess knowledge. If you know enough about chess, you'd
>always obtain the best possible result.

Yes.  But how would you *know* the search was optimal?
;-)



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.