Author: Terry Ripple
Date: 01:47:21 06/02/02
Could Fritz,Century,Tiger,Junior,or Crafty solve any or all the 5 piece endgame problems if given no time limit and not able to use Nalimov's tablebases? If the answer is no, then why not if the program could take any amount of time that it needed to find the correct answer to the solution? Thanks in advance for any information! Best Regards, Terry
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.