Author: Ed Trice
Date: 17:16:13 01/30/04
Go up one level in this thread
> >i guess you saw schaeffers paper on their 10pc db? they say they are using >something much better for compression now; it's probably similar to datacomp... > >cheers > amrtin Hello Amrtin, Did you change your name recently? :) It is pretty tough for me to spell mine incorrectly :) Yes, Gil and I were giving Jonahtan some of our code using my massively parallel indexing scheme and Gil's intelligent RLE compression. I am not sure if Ed Gilbert showed you the paper I wrote on how to make the 10-piece database while keeping as many as 24 machine busy for a good portion of the time. Ed also has some good ideas about improving the compression with a better dictionary for the Huffman encoding. I think he should finish his 10-piece database and try it out and see what his results are. I think he only did 5 kings versus 5 kings then stopped. A portion of our good results come from my holistic indexing functions which do not subdivide the database slice by leading checker ranks. In this fashion, you get much longer runs when pieces are hanging. That reminds me, I keep forgetting to send Ed my other databases for him to verify his 9-piece db with, thanks! --De :)
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.