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?
  • glibg10b@lemmy.ml
    1·
    4 months ago

    Base-3: 15 bits
    Legal states only: 13 bits
    Redundancy due to symmetry eliminated: 12 bits
    Combining the previous two: I estimate 10 bits