Author: Jouni Uski
Date: 22:10:03 09/18/03
Go up one level in this thread
On September 19, 2003 at 00:26:34, Pham Hong Nguyen wrote: >I have been working on generating for EGTB (for Chinese chess). As the next >stage, I am interesting in compressing algorithm of Nalimov's EGTB. Could >someone explain to me how that algorithm works (as details as possible). What is >the structure of compressed files? How does it slowdown the speed? >Many thanks for any helps. As You can see from Nalimov files: Compressed by DATACOMP v 1.0 (c) 1991--1998 Andrew Kadatch. Jouni
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.