Author: Dann Corbit
Date: 16:25:58 01/30/02
Go up one level in this thread
On January 30, 2002 at 19:16:06, Angrim wrote: [snip] >Nice clarification. And if this was actually what the method could do >it would be reasonably useful for openning databases. Unfortunately >what it actually does is: >1. take a billion positions that you want to store. >2. generate 39 billion other positions that are in some sense equivalent >3. store a billion positions to disk >4. claim that you stored 40 billion positions and got 40:1 compression. > >The critical point is that you can not compress an arbitrary set of >positions with this method. If you limit to a particular set of pieces it surely can (for example egtb files have only a subset of all possible pieces). So, let's re-visit the opening analysis idea: Perhaps (then) instead of compressing one billion arbitrary positions, what you really get is 40 billion positions for the price of one billion. Looking at it that way, it isn't such a bad trade-off. I'm not saying it *will* help in analyzing opening positions. But it might. Your arguement is certainly not convincing to me (but likely I'm just thick headed).
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.