Author: Dann Corbit
Date: 14:30:54 12/27/00
Go up one level in this thread
On December 27, 2000 at 17:23:37, Uri Blass wrote: [snip] ><snipped> >>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. > >I think that it dependent on the position. >If there is a short mate you are right but if the mate is a long mate like mate >in 10 moves then I expect chess programs to be faster in most of the cases. Depends. If mate in 10 is the shortest mate, then chest will probably still be faster. If there is a mate in 15 that is easily forced, then the program will find it faster, but maybe not the mate in 10. To find "a mate" chess programs will sometimes be faster. To find the shortest mate, it will be very rare that the chess program can beat chest. To prove that the mate is shortest also, I think chest is the only game in town.
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.