3 ms·
Most games could possibly be encoded in less than 26 bytes. There are not that many legal moves each time and if you sort them by probability it may not require
by petters 3y ago
Most games could possibly be encoded in less than 26 bytes. There are not that many legal moves each time and if you sort them by probability it may not require many bits to describe which one the players chose.
- NelsonMinar 3y agothat may be but it's not what the article is about.
- lainga 3y agoA Huffman code ...? The starting board is 0, 1.e4 is 1, etc...
- OJFord 3y agoYou could probably do something to compress algebraic chess notation in such a way, and even without it as GP says it might cover a decent number of games. My point was you couldn't guarantee a fixed length in 26B, afaik. (That was the article I expected from the malformed title here: a combination of an efficient encoding and it can it can only get longer than this by repetition so here's a very clever thing we can do, or something.)
- IshKebab 3y agoI doubt it. You could maybe get as low as 1 bit per move, but how many games are only 26 moves? Would be interesting to find out though! Maybe this paper says. I didn't read it. https://www.researchgate.net/figure/Entropy-and-distribution-of-move-time-depending-on-move-number-A-Probability-of-the-70_fig2_47622010 https://www.researchgate.net/figure/Entropy-and-distribution...
- OJFord 3y ago1 bit per move would allow you a 26x8 move game in 26 bytes, not just 26.