Computer Chess Club Archives

Search

Messages

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

Author: Ingo Lindam

Date: 15:25:46 12/10/02

Go up one level in this thread

>>You do not always need a tree in order to solve problems.
>>I can prove that KR can beat K without a tree and without tablebases.
>
>However, until the tree is completely searched it remains possible that there is
>an alternative to the proposed solution.

Oh!!!

You mean there could be TWO ways to win KR against K?????

:-))))

just turn to something completely different
turn to

knitting a pullover!!!

can you just make a plan for doing that by making a picture or description for
every single loop?

ingo

• Re: What do programmers think about a chess algorithm?? Dann Corbit 15:30:42 12/10/02
  • Re: What do programmers think about a chess algorithm?? Ingo Lindam 15:44:55 12/10/02
    • Re: What do programmers think about a chess algorithm?? Dann Corbit 15:54:33 12/10/02
      • Re: What do programmers think about a chess algorithm?? Ingo Lindam 16:16:06 12/10/02
        • Re: What do programmers think about a chess algorithm?? Dann Corbit 16:36:21 12/10/02

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.