Author: Graham Laight
Date: 06:25:02 05/05/01
Go up one level in this thread
On May 04, 2001 at 13:34:42, Dann Corbit wrote: >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? >;-) Good question! Unless someone can prove it, it may never be known. Unfortunately, when tournaments/tests are producing nothing but hundreds of draws, the emotional interest in computer chess will inevitably start to wane, though. -g
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.