Author: Robert Ericsson
Date: 04:38:11 02/18/99
Go up one level in this thread
On February 17, 1999 at 00:38:45, Dann Corbit wrote: >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. Problemiste is much too limited. Just solves mates, helpmates and selfmates up to 6 moves I believe. But to solve chess problems I do propose Popeye or Natch ( I don't know there to find Natch but try Chess Space or any other page with chess links). Use chess playing programs for play and chess problem solving programs for chess problems. Okey, it might be interesting to see if a chess playing program can find a distant mate but if there is a mate in 10,12,..., 20 moves the position on the board is certainly winning in most cases anyway. Robert
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.