3 ms·
That's neat, so it looks like ln2(216) =~ 7.7 bits to encode any valid move, and then compresses to even better!
by joshka 3y ago
That's neat, so it looks like ln2(216) =~ 7.7 bits to encode any valid move, and then compresses to even better!
- groby_b 3y agoYep. There's a paper somewhere claiming that the lower bound is ~5.1 bits/move, based on an exhaustive analysis of existing games. https://www.chessprogramming.org/Encoding_Moves https://www.chessprogramming.org/Encoding_Moves sort-of mentions it (search for 5.11), but I can't for the life of me find the actual analysis.
- joshka 3y agoYou might be interested in the author's follow up post where they reach 3.7 bits/move after compression. https://mbuffett.com/posts/compressing-chess-moves-even-further/ https://mbuffett.com/posts/compressing-chess-moves-even-furt...