Author: martin fierz
Date: 12:51:50 03/28/02
Go up one level in this thread
On March 27, 2002 at 21:45:42, Eugene Nalimov wrote: >Under x86 Windows you can get 3Gb of address space, not 2Gb. > >And out of curiosity: had you tried to compress with DATACOMP.EXE? a good question, as it turns out! - not very surprising, of course :-) i produced my intermediate files as output and tried datacomp on them - it compresses them better than my RLE algorithm; the file sizes which datacomp produces range between 50% and 70% of my file sizes. i didnt compare the total ratio, because i have about 1000 files, but just from the 10 i compressed it is clear that datacomp is clearly better. which makes my next question obvious: what is datacomp doing? and how fast is the decompression of datacomp'd files? in checkers, fast access to the databases is probably more important than in chess, because unlike chess, where these TB positions don't crop up too often, in checkers, the db gets hit all the time - like 10% of the nodes you search are db hits already in midgame positions, and in endgames, every node you search is in the db. aloha martin
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.