[1] https://en.wikipedia.org/wiki/Zermelo%27s_theorem_%28game_th...
A similar situation arises in the game 'hex', except in that game there is no draw, so it has to be a p1 win!
Please do so, as I do not see that this is trivially true. I see two tricky cases:
- your opponent must play on the board where p1 is placed, and that board would have room iff p1 weren't present => Addition of p1 gives him a 'move anywhere' move.
- you must play on the board where p1 is placed, and that board would have room iff p1 weren't present. The normal argument 'move anywhere and assume that that 'anywhere' is where your first move went, and you just played p1' does not help here, as changing the first move may change where your opponent's first move could have gone.
Except from an exhaustive search, I do not see how to prove that you can prevent either case.
Actually, the fact you force your opponent isn't the problem (I don't think) but the fact that the presence of that piece might later give p2 a free move, where previously they wouldn't means it doesn't work.
Sorry, that's what I get for thinking I didn't need to figure out all the details carefully!
Harder to draw a lot on napkins though, but then again, a single game takes much longer.