Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mates in 30

Author: Laurence Chen

Date: 08:29:57 02/16/99

Go up one level in this thread


On February 16, 1999 at 11:09:59, Harald Faber wrote:

>On February 16, 1999 at 10:22:50, Steve Maughan wrote:
>
>>The position quoted is a famous one - it can be solved with the simple heuristic
>>of extending all move that give check with only one reply and extend all
>>position that only have one move.  The reason the top programs do not get it is
>>that they have cut off the search at some high value to limit the tree in normal
>>position.  This is certainly not a normal position!
>>
>>Regards
>>
>>Steve Maughan
>
>But that is s.th. Chessmaster is extremely strong in. Doesn't he really find the
>solution?
Just because the engines find the first few moves does not prove that they see
the forced mate in hand. Chessmaster is not able to see the mate until move 15
in which is able to see the forced mate. That means that the operator will have
to play all the forced moves up to move 15 before CM 6000 is able to see the
mate.



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.