Computer Chess Club Archives

Search

Messages

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

Author: Uri Blass

Date: 20:16:45 01/02/01

Go up one level in this thread

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?

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

• Re: What is the most difficult MATE to find for a computer program ??? Olaf Jenkner 10:04:38 01/03/01
• Re: What is the most difficult MATE to find for a computer program ??? Paul Petersson 07:23:52 01/03/01
  • Re: What is the most difficult MATE to find for a computer program ??? Uri Blass 08:38:50 01/03/01
    • Re: Retro-Analysis (Natch) Heiner Marxen 10:05:01 01/03/01

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.