Author: Jonathan Lee
Date: 13:43:52 02/04/01
To the perfectionists out there, how important is the machine to find the fewest number of moves of a checkmate? The computer finds a "Mate in 10" for example in less time than say a "Mate in 5" later on. (The Mate in 5 would be the fewest number of moves.) Obviously the title's variables are: X is a positive integer and (Y is a positive integer AND X>Y). Which programs have this very minor problem? Jonathan (94th message)
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.