Author: Fernando Villegas
Date: 09:30:31 11/22/00
Go up one level in this thread
On November 22, 2000 at 11:51:17, James T. Walker wrote: >Hello Fernando, >I can only tell you there are many problems with all programs. None of them are >perfect. As a beta tester you can only report what you find. There are >literally hundreds of special positions which many programs do not understand. >Tablebases will cure many of these problems but not all. The programmers are >aware of many of the shortcomings of their programs. They make the decision if >it is important enough to fix or forget. I guess they only have so many hours >in a day and they have to decide what is most important at the moment. >Jim OK, Jim, but you must concur with me that B+N mate is not just one problem between many, but a clasic kind of position every current program must solve and every tester must look at as a matter of fact. The same with: a) king + pawn againts King b) King + Rook againts King c) King+ pawn in the h or a file d) oposition rule e) king +queen against king +rook ... And maybe some more. I think that these kind of situations should be tested as a minimal test of proficiency. Should be kind of a rule of testing operations. Regards fernando
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.