Author: Omid David
Date: 16:50:51 09/14/02
I'm currently looking at the results of several algorithms on ECM test suites. I find many positions that the program has played the correct move for wrong reasons, without finding the correct variation at all. I know that almost all researchers automatically count these positions as solved, but is it wise to do so? For example if one algorithm find the correct move without seeing the combination behind it (e.g. score = -1.50), and the other algorithm finding the whole combination (e.g. score = +7.50 or even seeing the checkmate), is it fair to to count the position as solved in both cases?! In addition, there are a good number of positions in the ECM, in which better moves than the mentioned ones, do exist; that's why IMO automatically counting the correct moves is not enough, and a manual scan is necessary (although takes lots of time)... Omid.
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.