Author: martin fierz
Date: 14:21:07 01/30/04
Go up one level in this thread
On January 29, 2004 at 23:21:04, Ed Trice wrote: >Hello Eugene, > >> >>It looks that our approach is better :-) All 5-men TBs (more than 30Gb >>positions) are compressed into ~7.5Gb. No binary searches on probing are >>necessary, too. Andrew Kadatch wrote good compression/decompression code. >> >>Make the simple experiment: uncompress on of your tables, and compress it using >>DATACOMP.EXE (which is used to compress our TBs). >> > >I will give that a try. What is the website address for this? > >Thanks. > >--Ed i can already answer this for you because i tried this two years ago :-) datacomp is much better than my run-length-encoding, i.e. it is about as good as winzip in compression, meaning about twice as good as my compression IIRC. your checkers database is smaller than mine, but not that much that datacomp wouldnt be a big improvement. 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
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.