Author: Jay Scott
Date: 17:43:51 01/02/01
Go up one level in this thread
On January 02, 2001 at 05:30:07, Christian Söderström wrote: >So I am left with 4 bytes. I want to use these to store statistics >about the move, to support a future book-learning function. But the >thing is I'm not sure what information would be most useful to store! I think the natural pieces of information to remember are a score (some estimate of the goodness of the position) and an uncertainty (some measure of how good the estimate is). The score can be backed-up by minimax, backed-up a la Crafty by propagating influences backward from future search scores, computed a la CAP by search for each node, estimated from win-loss percentages in the engine's games or in a database of grandmaster games, or whatever. There are lots of ways, pick one you like. The uncertainty measure can be as simple as a count of the games that reached the position, or the amount of search time spent examining it. Ideally it should be based on a mathematical analysis of the sources of the information, but that could be hard. The score tells you what move to play in a tournament game. The uncertainty tells you when to experiment so that you can get scores accurate enough to use in a tournament. :-)It also gives you a hint about how to update the score when you get new info. Knowing how sure you are is critical for learning algorithms. Don't overlook the possibility of storing a large counter in few bits by approximate counting. Jay
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.