# A combinatorial chessboard strategy-game 2 players

We have a regular chessboard $$8 * 8$$ and a coin. There are two players: A, B.
Firstly, A places the coin somewhere on the chessboard
Then, B can move the coin in a cell in the same line or the same column with the cell where A placed initially the coin. Afther the first two moves, A and B both follow the same rule, namely: each player must move the coin in a cell o the same row or the same column with the cell where the previous player moved, and the coin shouldn't be placed twice on the same cell during the game. The last rule means that if A moves to (1, 3) during the game, neither B, nor again A can move to (1, 3) during the game. Prove that B can win each game, if both players are flowless.

I was thinking to prove that B can move always in the same color as the previous move made by A. Then, I should prove a lemma that B can always move somewhere, using the parity of the number of closed cells on a line/column as an invariant, maybe monovariant.

$$B$$ can always move $$(x,y)\mapsto (9-x,y)$$.