Author: Tom Kerrigan
Date: 02:11:26 12/29/01
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. 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.) Has this been done before? Are there any glaring problems with this idea? Does anybody want to try this? If so, I'd like some credit for it. If not, I'll probably get around to trying it sometime... -Tom
This page took 0.02 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.