Author: blass uri
Date: 13:10:36 04/26/00
Some programs can have main line ends with a mate without understanding that it is a mate(I saw that it happened to Crafty and Junior). I think that knowing if the position is checkmate or not checkmate is an important knowledge. It is possible to see it by search but I think that seeing it by evaluation is faster because you do not need to generate all the possible moves because discovering one legal move is enough. I guess that the reason that programmers avoided to do it is that they did not want their program to be slower and that they found that in most of the cases(when there is no checkmate) they waste time without earning something for it. How much time does a chess program need to find if a position is checkmate or not checkmate? Uri
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.