Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What is the most difficult MATE to find for a computer program ???

Author: Uri Blass

Date: 08:38:50 01/03/01

Go up one level in this thread


On January 03, 2001 at 10:23:52, Paul Petersson wrote:

>On January 02, 2001 at 23:16:45, Uri Blass wrote:
>
>>On January 01, 2001 at 18:36:57, Olaf Jenkner wrote:
>>
>>>Gustav finds the mate in a few minutes. It is not a difficult position
>>>for problem-solvers, because the black king has no more then one flight.
>>>
>>>Olaf
>>
>>What is Gustav?
>>
>
>Look here:



>
>  http://dmoz.org/Games/Board_Games/C/Chess/Software/Chess_Problem_Software/

Thanks

There are surprising programs at this site.

One of them (notch) construct a game based on a position
and the programmer even provides a source code.

I am interested to know what is the algorithm that is used
to compose a game for a chess position.

It is possible to look at the source code but
I understood that the comments are not in english so
I prefer to read a reply here.

Uri



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.