3 ms·
In the "Checkers is solved" paper, they state "The complete 10-piece databases contain 39 trillion positions (Table 1). They are compressed into 237 gigabytes
by howeman 11y ago
In the "Checkers is solved" paper, they state
"The complete 10-piece databases contain 39 trillion
positions (Table 1). They are compressed into 237
gigabytes, an average of 154 positions per byte!"
Do you have any idea how this would be done? It seems crazy.
- mappu 11y agoProbably just standard compression techniques - the linked article is mostly discussing a standalone move, but there are a lot more options available when working with large strings of text (dictionaries, BWT, arithmetic coding, ...). The downside is a lack of individual byte accessing without a lot of surrounding decompression work, but it'd be appropriate for stream processing In fact the best compressed size is probably found by reducing some of the clever tricks in the article in order to expose more structure to a general compressor. Similar to running `precomp` or `antiX` before solid-packing multiple already-compressed files.
- billforsternz 11y agoThat's interesting, as you say it sounds like magic. I will have a look at the paper when I get a chance. No doubt there is some amazing tree data structures involved. That's what chess endgame tablebases use, but it's not something I pretend to understand.