I recall lots of people found winning strategies when the game first came out. They were based on always sending the opponent to the same field.
More precisely, the game has a finite # of states, and cannot end in a draw. It's always a win for P1 or P2. If both people play perfectly, who wins and what is the optimal strategy? (Note: It is possible that this game is a P2 win, because your move restricts your opponent's choice.) (For the person with the guaranteed win, what strategy forces the win? For the person who can't guaranteed win, what strategy gives your opponent the most opportunity to make a mistake?)
In this game, there are (usually) at most 9 legal moves per turn. The branching factor is a lot less. (Giving your opponent free choice to play anywhere is frequently a mistake.)