adamcw/wordle-trie-packing
View on GitHub ↗ ★ 2 Python
Wordle clones are everywhere, but who is thinking about the bandwidth?
5 mentions on Hacker News by 1 person: 0 stories, 5 comments · first 2022-02-20 · latest 2022-02-21
20082026
-
…bytes, but this does better than both Brotli on a ASCII trie and the Huffman Trie by almost 1KB ( https://github.com/adamcw/wordle-trie-packing#all-words ), so I'm very happy.
comment by quicktwo · 2022-02-21 · in Game Boy Wordle clone: How to compress 12972 five-letter words to 17871 bytes -
…get the size down sufficiently to compete with using a trie+Huffman representation (15,599 bytes, https://github.com/adamcw/wordle-trie-packing#all-words ). 8 * 15,599/64,860 = 1.92 bits per byte.
comment by quicktwo · 2022-02-20 · in Game Boy Wordle clone: How to compress 12972 five-letter words to 17871 bytes -
…if you first turn the data into an ASCII trie then Brotli compress that (14,180 bytes) (Source: https://github.com/adamcw/wordle-trie-packing#all-words ).
comment by quicktwo · 2022-02-20 · in Game Boy Wordle clone: How to compress 12972 five-letter words to 17871 bytes -
…because all Wordle words are length 5. Meanwhile, bitpacked trie can get down to 15,599 bytes. https://github.com/adamcw/wordle-trie-packing#all-words It's not clear to me a path that will compress the DAWG so much that it could cut…
comment by quicktwo · 2022-02-20 · in Game Boy Wordle clone: How to compress 12972 five-letter words to 17871 bytes -
You can get down to 15,559 bytes by combining a trie with Huffman coding: https://github.com/adamcw/wordle-trie-packing However, this doesn't beat general Brotli encoding of a ASCII trie representation, which gets down to 14,180 bytes (but…
comment by quicktwo · 2022-02-20 · in Game Boy Wordle clone: How to compress 12972 five-letter words to 17871 bytes