Computer Chess Club Archives


Search

Terms

Messages

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

Author: Georg Langrath

Date: 03:25:38 12/27/00

Go up one level in this thread


On December 27, 2000 at 04:00:56, Uri Blass wrote:

>On December 27, 2000 at 03:32:47, Georg Langrath wrote:
>
>>On December 27, 2000 at 03:03:26, Tania Devora wrote:
>>
>>>
>>>
>>>
>>>The combination for find a Mate always are beautiful, I was trying to find very
>>>difficults Checkmates  for the computer programs. I will like to know what is
>>>the most beautiful Mate or the most Hard Mate to find for the computer programs!
>>>
>>>
>>>I think that Chessmaster engine is wonderful finding very difficult Mates.
>>>I dont know why, But, I see one that Chessmaster look in 1 sec!  And Fritz never find it.
>>>
>>>In resume, what is the best program finding Mate problems and why?
>>>
>>>
>>>Thanks to all!
>>>
>>>Tanya.
>>
>>You say that Fritz don't find your mates. Do you really use Fritz built in
>>mateprogram Mate 2.0? It should find your Mates.
>>
>>Georg
>
>Chessmaster has mate extensions that fritz does not have so it is possible that
>chessmaster may find mate in 14 in one second when Fritz cannot find it.
>
>Uri

That is possible, but it was the sentence "And Fritz never find it" I reacted
on. Never is a long time :)

Georg



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.