Why does the copycat strategy work for two parallel chess games?

I'm currently looking into computability logic.
Japaridze explain that a game !P v P like !Chess v Chess is always winnable thanks to the copycat strategy (http://www.csc.villanova.edu/~japaridz/CL/3.html#copycat). However, what guarantees that the environment will play the same moves? One game could be e4 e5, but the other one e4 Nf6, and then the machine won't know what to do, right?

I'm probably not getting something, but I don't know what. Could someone help me?

Thanks.

The setting in the link you gave (where is it referred to as $chess\lor \neg chess$) is that the player is playing on two boards with different colors, and has to win in at least one.

In that case you can win by mimicking your opponent as follows. Let $b_{\text{white}},b_{\text{black}}$ be the boards on which you play white/black correspondingly. Whenever the opponent makes a move $x$ on $b_{\text{black}}$, you play $x$ on $b_{\text{white}}$, similarly when your opponent makes a move $x$ on $b_{white}$ your play $x$ on $b_{black}$. The result is that you are playing the same position on both boards, only with different colors.

StackExchange Computer Science Q#94189, answer score: 8