I meant optimal perfect strategy, either via a proof or a game tree search (alpha-beta pruning). With 3^81 game states (most not attainable), it should be searchable.
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?)