Author: Bruce Moreland
Date: 18:01:41 04/04/00
Go up one level in this thread
On April 04, 2000 at 18:57:59, KarinsDad wrote: >PS. However, if a computer announces mate in 573, it should have to prove it and >should have to play unless it's opponent resigns. The TB code or the TBs could >have a bug, so it's only mate if it is mate. IMO. Why should it get the opportunity to prove it, if it takes 14 hours to do it, requires an exception to FIDE rules to do it, and requires that I modify *my* program so that it will allow the game to continue after it is over according to FIDE rules? bruce
This page took 0.01 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.