Re:How to Store a Chess Game in 26 Bytes Using Bit-Level Mag...
by thechao on Friday September 15, 2023 @01:23PM
(#37526368)
You only need 5b to encode the piece to move: you know whose turn it is. Also, as the game progresses, you can reindex to reduce the number of bits to define which piece is moving.
[ Parent
| on HN ]
Re:How to Store a Chess Game in 26 Bytes Using Bit-Level Mag...
by thaumasiotes on Friday September 15, 2023 @10:47PM
(#37531565)
> You only need 5b to encode the piece to move: you know whose turn it is.
If you want to encode the piece (rather than the square), and you're comfortable not counting "whose turn is it?" against the information requirement, you don't need 5 bits. Each player has only 16 pieces, so you can give them all four-bit names.
You won't know what kind of piece they are, though.