Author: Robert Hyatt
Date: 07:50:52 06/02/02
Go up one level in this thread
On June 02, 2002 at 04:47:21, Terry Ripple wrote: >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 Solve = See the mate, or Solve = play moves good enough to win? In many endings, the computer can do fine. But not all. IE KNN vs KP is very difficult. Particularly if you want to actually find the mate which can be well beyond 200 plies...
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.