Author: Robert Hyatt
Date: 11:39:33 10/23/99
Go up one level in this thread
On October 23, 1999 at 13:21:21, Torstein Hall wrote: >On October 23, 1999 at 12:52:11, Robert Hyatt wrote: > >>On October 23, 1999 at 11:14:07, Michel Langeveld wrote: >> >>>Thanks in advance. >>> >>>I want to try it myself ;-)!!! >>> >>>Michel Langeveld >> >> >>It is too early to say. Compared to the opening book I use, less than 100K >>of the positions have CAP scores. Which means that many positions have no >>data at all. >> >>Another problem is that the CAP data is of the form >> >> <position> <score> <best move> >> >>I can use that... but what I _really_ need to do, and I don't have the code >>to do yet, is to do a simple minimax of the CAP scores back up thru the book. >>IE if the best move in position P is Rh1 with a score of +1.3, then I need to >>know that any move that leads to position P (with no cap score in the file) >>ought to have a score of -1.3. I don't do this yet, which hurts. I think it >>will be even more useful once I have time to write that code. > >What is CAP scores? > >Torstein These are frequenly occuring positions, searched to very deep depths in a mass search problem. I have taken the scores and merged them into a new book structure for 17.0...
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.