Author: Ricardo Gibert
Date: 17:03:43 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... Also, the more checks and captures the winning side has to bypass, the harder it will be, since programs will tend extend and waste time on these. > > >> >> >> >>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.
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.