Computer Chess Club Archives


Search

Terms

Messages

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

Author: Paul Petersson

Date: 07:23:52 01/03/01

Go up one level in this thread


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/


Paul


>Is it the only program in the world that is supposed to solve studies better
>than the top programs.
>
>I know that there are programs to check selfmates and helpmates but I did not
>know that there is a program that is supposed to solve studies faster than the
>top programs.
>
>Can I read results of gustav(position and time in different studies) in order to
>compare with other programs.
>
>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.