Author: Steven Edwards
Date: 19:43:42 05/16/05
Go up one level in this thread
On May 16, 2005 at 22:17:44, Jeremiah Penery wrote: >On May 16, 2005 at 16:18:37, Steven Edwards wrote: >>On May 16, 2005 at 15:35:29, Matthew Hull wrote: >>>I see. How is the current GA process progressing on the problem set? Also, >>>does the Symbolic application run in a GUI, a console (or either)? >> >>The current GA run against BWTC has broduced a recognizer that picks the best >>move in 722 of the 1,001 positions. This was produced after 320 breeding >>cycles. > >Have you thrown out positions that are either wrong or have multiple 'best' >moves? After a few judicious edits of the suite's best moves, there are only five or so questionable positions; not enough to be a problem. All 1,001 positions are used, although the 100 or so composed problems are not much like positions seen in actual competition. They should probably be removed. Positions with multiple best moves are handled as a match if the GA's best move selection matches any of the listed best moves. I will later make a mating test suite that has mates of length three or greater as Symbolic's ChessLisp interpreter already has intrinsic functions for MateIn1 and MateIn2 (and LoseIn1 as well).
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.