Author: Antonio Dieguez
Date: 11:05:07 12/29/01
Go up one level in this thread
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... >You could run this on lots of positions from GM games, to get your program to >play like a GM. (At least in some positions, heh.) there could be many a3/a6/h3/h6 moves or slow preparation for a break etc. If the program has not the necessary terms about some strategic stuff or something varying weights may be not good to acomplish such moves, and tunning to that moves or others will just hurt the others! I'm just not a believer :)
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.