Author: Tom Kerrigan
Date: 04:48:38 12/29/01
Go up one level in this thread
On December 29, 2001 at 07:44:19, Sune Fischer wrote: >On December 29, 2001 at 07:24:06, Tom Kerrigan wrote: > >>There is nothing in my idea that is specific to tables. >>-Tom > > >Must have been all the talk about the knight on h8:) > >Still you dimensional search space is very large, and with each concensus eval >that expensive, you can't really afford a sloppy approach. >Genetic algorithms might do the job if you can define a good consensus/scoring >function, which is no trivial thing to do in the first place. > >-S. I think we're talking about different algorithms. My idea is for making a program play a known-good move, not to find ideal values for all eval weights. The hope is that if you force the program to make enough good moves, the eval weights will end up being pretty good. -Tom
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.