Efficient algorithm for counting unique states of tic tac toe

Question

I\'m trying to build a tic tac toe game to demonstrate and experiment with machine learning algorithms, and i\'ve found an interesting problem.

eg: a tic tac toe board c

Answer 1

I think graph theory is good for this, you would have a graph with 9 vertices for the example you gave. The only thing that could still be a problem is juxtapositions.