Author: Dann Corbit
Date: 13:32:03 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! Beauty is in the eye of the beholder. The most difficult is the one from here: [D]rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - As I don't know if anyone has even found it yet. ;-) >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. I suspect you will find some vice-versas if you look hard enough. >In resume, what is the best program finding Mate problems and why? Chest is the best mate finding program unless you need a deep tablebase search to find it. That is because it is a special purpose checkmate finding program and the mates it discovers are provably shortest. It also usually finds mates faster that ordinary chess playing programs on the same hardware. And besides which, Heiner is a very nice guy. ;-)
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.