Why can’t you lose a chess game in which you can make $2$ legal moves at once

algorithmic-game-theorychessboardgame theoryinfinite-games

So here is the Problem :-

Consider a normal chess game in an $8*8$ chessboard such that every player makes $2$ legal moves at once alternatively . Now imagine that you was asked to play with Magnus Carlsen .Then Prove that it's impossible for Magnus Carlsen to make you lose, or atleast can make you draw.

I was actually stumped when I first saw this . Also I tried thinking many normal chessgames and tried to understand what type of answer this question can take . From here I can say that a check on the $1st$ move made by any player is actually a checkmate . Other than that I have no idea, can anyone help ?

Edit :- I forgot to add another thing . It's given that I will be white and Magnus Carlsen will be black .

Best Answer

While some of the details of the rules may still be ambiguous in boundary situations, it is clear that white can avoid a loss by opening with

  1. ♘b1-c3,♘c3-b1

or

  1. ♘g1-f3,♘f3-g1

More precisely, if either of these no-ops in fact leads to a position where black can force a win, then white could force a win by playing by black's strategy mirrored.

Related Question