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?
  • cbarrick@lemmy.worldOPEnglish
    4·
    9 months ago

    OP here! People are rightfully pointing out that this can be compressed further.

    My challenge to you: Implement a compressed representation along with the get_cell and set_cell methods, without resorting to lookup tables!

    Also, check out Alejandra’s blog at https://goose.love/!

    (And yeah, you need 12 or 13 bits, not 10, if you don’t want to eliminate symmetries.)