Author: Michel Langeveld
Date: 22:42:48 11/17/99
Go up one level in this thread
On November 17, 1999 at 18:04:58, Dann Corbit wrote:
>On November 17, 1999 at 16:18:24, Michel Langeveld wrote:
>[snip]
>Three very good ideas.
>>1)
>>An other idea, (I possibly already said), is to do all the positions of the
>>crafty book(s). So all positions have CAP Data. I already programmed an crafty
>>that's pugged all the unique positions during book creation to the LOG.xxx file.
>>In this way I new look at non-cap-ed positions and do them....
>I am especially fond of this one. Can you create the following table for
>positions without analysis:
No problem. I just programmed in about 2 lines that the book will contain and
EPD position. And in 1 line when sorting the book the output will bu pugged to
the log file. It will be very easy to output in the logfile before the epd
position the occerence ans sort on it like.
sort < log.001 > send_to_dann.txt
I'm at work now and I shall send you in about 12 hours some info.
It's good you collected a very large pile of PGN. Now we can analyse all
positions in order of occurence.
>[Frequency of hits] [EPD position]
>
>e.g.
>600213, r3kbnr/ppp2ppp/2p1bq2/8/4P3/3B4/PPP2PPP/RNBQK2R w KQkq -
>600001, r1b1k1nr/2ppqppp/pbp5/4N3/3PP3/2P5/PP3PPP/RNBQ1RK1 b kq -
>etc?
>
>That way, we can process the most important rows first. It would be especially
>good to build an enormous book using a ton of PGN, if you know what I mean.
>That way, we will get the best stats from real usage.
It's clear!
>
>>2)
>>It's also possible to look at the current EPD's <= 30 ply from the initial
>>position and look if the move crafy recommends is an EPD positon that's already
>>in the CAP data. If's it's not it has to be analyzed. In this way new
>>theoretical lines are analyzed to an certain level.
>Another dandy. Do you have code to accomplish this already?
No, no code ready. But it will not very difficult to write. I think it's easy to
change search.c so it will only analyse moves which leads to CAP position. What
means there must be added a line like
search(...)
{
if (!inCapData(TREE.epd, &CAPvalue)) exit;
TREE.capValue = CAPvalue
if abs ( formerPosition(TREE).CAPValue - CaPVAlue) ) > 1
{
write_SuccPosition_To_Log_Which_Are_Not_CAP_ped_Already(TREE.epd)
}
...
}
[snap]
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.