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?