Author: Walter Ravenek
Date: 06:34:30 12/15/97
Go up one level in this thread
On December 13, 1997 at 16:50:22, Don Dailey wrote: >I have an idea for generating a positional problem set to >measure our chess programs against. This will take some >cooperation and should involve many programs. > > 1. Start with (n) positions from Grandmaster games and make > a note of the move the grandmaster played. > > 2. Run each participating program for some length of time (t) > on each position. Note the move the program chooses at > the end of the allotted time. > > 3. Determine which positions there is a "consensus" on. The > best move must be agreed on by all programs. > > 4. Throw out the "easy" ones. Consider this our problem set. Seems like an idea worth trying to me. I'll run the problems in your reduced set with Arthur. I wonder whether CilkChess is able to determine the second best move (I do this by throwing out the best move and researching). If so, you could detect at least some of the tactical positions by requiring that the gap between the best and the second best move be less than a given value, say half a pawn. Walter Ravenek
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.