Author: Dann Corbit
Date: 14:44:25 06/28/99
I have a lot of chess data, with a ludicrous amount coming soon. Here is my problem. I want to read the data into a tree structure (don't worry about space, I have big mainframes here) and then refine it. But the problem is that the data is not all of the same quality and some of the data will be missing. For instance, we have about 600K EPD rows at 12 minutes of PII 300 MHz equivalent time. We also have about 10K at 8 hours of time. But we have tens of millions at 2 seconds. So, I don't think that a simple mini-max is appropriate because the data is of vastly different quality. Imagin, I am at some node. Now it has been analyzed to 16 plies and the children (of which there are 40 possible) have only 14 entries. Of these two are at 15 plies and 5 at 12 plies and 7 at 9 plies. How can I update the parent from this? It seems to me that only the 15 ply points can be used as a reference because the root has already seen deeper than all the others. Does anyone have algorithm suggestions? Is there a modification to minimax that will render it useful?
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.