Author: Dann Corbit
Date: 21:38:45 02/16/99
Go up one level in this thread
On February 17, 1999 at 00:28:15, Paulo Soares wrote: >I am interested in programs for direct mates (mate in >2, 8, 10, 30, etc). Somebody could say something about Alybadix, >Gustaf or others? Those programs are NOT what you want. They do not find distant mates. What they *do* find is the shortest possible path to mates even in the most difficult of problems for ordinary chess computer programs. Some positions may be Zugzwang or the like and the mate may not even be seen by an ordinary chess program. These mate solvers will absolutely find the most efficient possible mate. Some of them will produce an "audit trail" to demonstrate the mate. If you want distant mates, just get a program with a tablebase and run some sparse positions through it. You can give Problemiste a try. One warning, though. It only reads white to move EPD correctly. But it does not make mistakes when you set the board up manually. http://perso.easynet.fr/~mleschen/prb/problem.htm There's another interesing one listed on KK's home page [IIRC] but I tried it and it does not read EPD at all.
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.