Author: Antonio Dieguez
Date: 22:19:35 12/29/01
Go up one level in this thread
On December 29, 2001 at 14:05:07, Antonio Dieguez wrote: >On December 29, 2001 at 05:11:26, Tom Kerrigan wrote: > >>Here's my idea. >> >>You have a position and you want your program to play a certain move (which it >>presumably isn't playing). You run this algorithm: >> >>1. Search the position, get a PV. The evaluation of the last position of the PV >>is eval(1). >>2. Search only the move that you want your program to make, get a PV. This >>end-point evaluation is eval(2). >>3. Figure out which eval terms are different between eval(1) and eval(2). >>Decrease the weights of all the different eval(1) terms slightly. Increase the >>eval(2) terms slightly. >>4. Repeat until the program plays the move you want. > >actually this is what we always do, but manually, and not modifing the weights >until we decide they were too high or too low... I suspect now that doing this automatically as you say is not simple at all. You need luck because it could be an infinite loop unless a further elaboration is done.
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.