The game can be super condensed if both players are assumed to play optimally. The full state machine enumerated here: START case YOU_ARE_FIRST_PLAYER =

The game can be super condensed if both players are assumed to play optimally. The full state machine enumerated here: START case YOU_ARE_FIRST_PLAYER == T: DRAW case YOU_ARE_FIRST_PLAYER == F: DRAW Of course, for deterministic games and optimal play, either the first player always wins, the second play always wins, or it is always a draw. More interesting, if just one player (i.e. the computer player) always plays optimally, and favors the fewest states, that reduces the number of possible "valid" game states. So maybe less than 10 bits needed? 765 - 2^9 = 765 - 512 = 253 states would need to become unreachable for that to help.