Store a chess move in one byte at average case

I want an efficient, one byte way to store a chess move. Standard Algebraic chess notation takes too many bytes, and other solutions I came up with (such as numbering the squares 0-63 and them appending the numbers one after the other) also don't work. I also understand that stuff like promoting might take more than one byte, but I want a standard move to take an average of one byte. Is there any standard / algorithm for that?

https://stackoverflow.com/questions/67200637/store-a-chess-move-in-one-byte-at-average-case April 22, 2021 at 01:21AM