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: 12:42:04 12/27/00

Go up one level in this thread


On December 27, 2000 at 15:28:27, Robert Hyatt wrote:

>On December 27, 2000 at 03:03:26, Tania Devora wrote:
>
>The most difficult mate is the kind where the winning side makes _no_ checks
>or captures until he mates the opponent.  There is no "clue" for the search to
>extend the mating line and find it quickly. These are killer type positions.
>One fair example is win at chess # 141 where the first move simply tosses a
>queen away and is not a check.  It isn't terribly hard to solve, but it will
>give you the idea of what is hard vs what is easy...

It is better to have also zunzwang in the solution to do the mate more hard to
find(at least for null movers)


My mate in 17.5 problem that I posted in another post(black begins and say mate
in 17 against itself) combine zunzwang with the fact that 18 plies of the
solution are not check moves and not captures.

I will not be surprised if no program can solve it in 24 hours.

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.