Question

 Imagine you are playing a new version of the game of chess, called Pravega chess. the rules are same, with just one exception. You have to play 2k moves at a time, where k is any natural number. Prove that, black who plays second always has a non-losing strategy.

Answer 1

you have to  play with 1 k moves.