I recently stumbled upon a blog post by Alejandra González (a.k.a @blyxyas) that seeks to compress a tic-tac-toe game state into as few bits as possible. She arrived at a solution in 18 bits. This got me thinking, can we do better?
log(3^9)÷log(2) is 14.26. So ya, 15 bits for a naive encoding. Amazes me they wrote a whole blog post for such a trivial thing. Doesn’t seem like their intent was trying to be educational for those new to base math or CS.
log(3^9)÷log(2) is 14.26. So ya, 15 bits for a naive encoding. Amazes me they wrote a whole blog post for such a trivial thing. Doesn’t seem like their intent was trying to be educational for those new to base math or CS.