Author: Marek Soszynski
Date: 13:19:55 12/17/05
Go up one level in this thread
Playing programs are not usually programmed to find the shortest mate. Once they find a forced mate, any mate, they often stop analysing altogether. And the mate that is found first will not necessarily be the shortest. If you want to find the shortest forced mate in a position or alternative mates you need a dedicated mate-solving engine.
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.