Author: Tom Kerrigan
Date: 16:56:59 07/25/00
Go up one level in this thread
On July 25, 2000 at 19:54:02, Pete R. wrote: >On July 25, 2000 at 19:35:50, Tom Kerrigan wrote: > >>I've tried something like that. >> >>I wrote a program to go through a few dozen of Kasparov's wins. It did a 2-ply >>search on every position and gave itself a point if it correctly predicted >>Kasparov's move. >> >>At first it seemed like the number of points was useful and it was easy to tune >>my evaluation function to maximize the points. But then I found out that while I >>was maximizing the points for 2-ply searches, the number for 4-ply searches was >>dropping. So it was actually counterproductive. :( >> >>-Tom > >I'm assuming that there can't be any immediate tactics going on in the position >at all, and I'm not sure how many test suites have such positions, but you would >likely have to hand pick them. I didn't hand pick any of the moves from Kasparov's games. I just figured that the program would always get some of the [tactical] positions wrong. -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.