Math Puzzle (hard)

Ok I guess this really isn't a puzzle, but I saw it in MATHCOUNTS, (I got 29/30 on Sprint):

Prove that if each player has two turns on each move, White has a strategy to not lose. 

DM me the answer

Well, basically frick this if it doesn't have a visual representation on its account. 

I'll just put a game that has white win here: https://www.chess.com/games/view/16372499

i don't understand

I'll add more context here: 

These

? so is this a chess-related puzzle or what

exactly lol

white can just move the queen out and if black doesn't defend you can capture the f7 pawn and then the king on the same move because you get 2 turns

prove it

it is simple to prove

g6-gxh5

guys, there is no chess involved

use proof by contradiction

ok if it has nothing to do with chess is it in general for any game where the first player always has a strategy to never lose?

and what would the starting assumption be? assuming that there is no strategy where white wins? 

I know the the solution for chess with double moves. Let's suppose that black will win no matter white plays. If white can just stay (Ng1-f3, Nf3-g1), now we have initial position, but with black turn. Now if it was white turn, they lose. If it's black turn, black loses. Black also needs to repeat moves to draw. What was required.

I also took MATHCOUNTS and i can confirm that 1) this was NOT on the sprint and 2) if this was you would be violating the honor code. also 3) proof-based problems are not on MATHCOUNTS.

you are correct

mathcounts has no proof based problems and also, it doesn't make sense that they have chess problems

I know, I didn't take it from MATHCOUNTS, I just saw the problem when I was there. 

correct

ah

no, it's implied that it's for a chess game, sorry for no clarification.

look at mrxx2018 solution

ok im litterally 9 years old and i have no idea what the heck ur saying

The game of double chess is played like regular chess, except each player makes two moves in their turn (white plays twice, then black plays twice, and so on). Show that white can always win or draw.