Author: Ratko V Tomic
Date: 15:24:52 10/01/99
Go up one level in this thread
> A couple gigs (actually bigger than the raw PGN!) A well sorted tree with moves enocoded with a simple legal move generator and a statistical encoder (e.g. arithmetic coder) would probably fit these 2 million games in 50 Mb or less (additional info, year, player's etc would need to be compressed differently). It would save not only your disk space but would make it cheaper to transfer to other systems. To use, one would need some kind of driver that works like disk compressors, i.e. transparent to the applications and which reproduces the pgn format for each game. Or, for higher performance database, one would have to write a database program which works on the highly compressed games. But with 10 Gig or bigger disks cheap and getting cheaper, it probably isn't worth the trouble.
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.