Author: Vincent Diepeveen
Date: 15:00:23 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... > For normal chessprograms you are right if you add to that that the branching factor needs to be huge too from human sight seen... The real hard mates are the mates that are useless to see. Some Sjeng dude is criticizing me for seeing that mate in 30 soon, well the same extension has already won dozen of nearly lost games against mankind at icc. The real hard mates for normal chess programs are in positions where you're already 10 pieces up and where finding the mate a bit sooner is completely useless. Nevertheless still many programs will remain doing a good job at them. Special mate searchers should be able to do a real good job in finding mates in such positions, as there are always heuristics to follow in a selective way which are going to reward. Yet i'm sure not going to burn system time for special mate searchers before my normal search... ...so Bob's statement is pretty damned right for now... >> >> >> >>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.