Computer Chess Club Archives

Search

Messages

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

Author: Olaf Jenkner

Date: 15:36:57 01/01/01

Go up one level in this thread

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

• Re: What is the most difficult MATE to find for a computer program ??? Uri Blass 20:16:45 01/02/01
  • 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.