tcgfh / tictactoe Goto Github PK

It would be interesting to see a non-brute-force solution for determining a winning state in the board.
The current implementation blindly scans the 8 possible winning combinations for 3x3 tictactoe with values on the board to check if there is a winner.

Can we make the algorithm more efficient? Surely, if we know the position and value of the last token placed, and if we make the assumption that the move before that was not a winner, we need check only a subset of the winning states.