Author: Pham Hong Nguyen
Date: 20:10:21 01/29/04
Go up one level in this thread
I understand your method of compressing now - a kind of compressing/decompressing on fly, using run length code method, right? I see that method is quite simple and fast. However, I guess (oops, Nalimov has shown in his post) the compress ratio should be lower than one of a general and strong compress method (LZH?) as Nalimov used for his tablebases (obviously, your method did not compress legal positions, where Nalimov one did). Yours may apply worse to chess than to checkers. IMO, I don't like the idea of using complex compress method as DATACOMP program. However, I like the idea of separation of generating and compressing processes as well as good ratio of this program. +Pham
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.