Computer Chess Club Archives


Search

Terms

Messages

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

Author: Vincent Diepeveen

Date: 06:43:05 12/27/00

Go up one level in this thread


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!

[D]5n2/B3K3/2p2Np1/4k3/7P/3bN1P1/2Prn1P1/1q6 w - - 0 1 mate in 30

Diep needs 10k nodes and 0 seconds to find it.

How about the programs you have over there, do they need the same amount
of nodes?



>
>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.



This page took 0.01 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.