Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What do programmers think about a chess algorithm??

Author: Dann Corbit

Date: 10:53:34 12/11/02

Go up one level in this thread


On December 11, 2002 at 13:46:45, Ingo Lindam wrote:

>On December 11, 2002 at 13:23:23, Dann Corbit wrote:
>
>>I never said it 'has to be done with' -- only that they are equivalent and
>>alternatives will not be superior.
>>
>>For that matter, the tree is nothing more than a visualization aid.  The steps
>>will be the same whether or not a tree is used to visualize it.
>
>So I understand you right that to prove that following position will end in a
>draw is impossible by a giving proof less complex (smaller) than that very very
>big tree of all possible continuations...???
>
>[D] 6k1/bp1p1p1p/8/pPpPpPpP/P1P1P1P1/8/B3K3/8 w - - 0 1
>
>You are just kidding, aren't you?
>
>Internette Grüße,
>Ingo



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.