Author: Dann Corbit
Date: 20:53:05 07/06/00
Go up one level in this thread
On July 06, 2000 at 23:46:20, Vincent Diepeveen wrote: >On July 06, 2000 at 23:43:14, Dann Corbit wrote: >>On July 06, 2000 at 23:40:25, Vincent Diepeveen wrote: >>[snip] >>>Now if you show the CAP data to someone that's produced >>>after >>> >>>1.e4,e5 2.Nf3,Nc6 3.Bb5,a6 4.Ba4,Nf6 5.O-O,b5 >>> >>>r1bqkb1r/2pp1ppp/p1n2n2/1p2p3/B3P3/5N2/PPPP1PPP/RNBQ1RK1 w kq b6 acd 14; acn >>>101711325; ce 19; pv Bb3 Bd6 d3 Na5 Bg5 Nxb3 axb3 O-O Nc3 c6 d4 Qe7 Nxe5 >>>Bxe5 dxe5 Qxe5; pm Bb3; id "C.A.P. 442898"; >>> >>>WASTE OF MY TIME!!!! >> >>The only move that would have any interest at all is the first one (the pm) >>and it was played by: > >So now you say suddenly that i should not even take a look >at the mainline but ONLY at the first move? > >Why produce so many ASCII then? >Reduces your CAP data with at least 1/3 of its size! Indeed, the continuations are for amusement only. If you look at the Brainy project on my ftp site (written 6 months ago), you will see that in the binary format I don't bother with the pv *at all*. I store only the pm, bm, and am. Furthermore, I would always do a request of all positions forward one ply from where I am standing. And for those that look best, do a request for the positions forward from there. The way you use the data to search is limited only by your imagination. And with 6+ million pieces at long time control and 60 million at fast, there is a prodigious amount of it. Tons of crap or tons of angel-food-cake? Time will tell.
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.