Two players play the following game on a square of N×N squares. They color one square in turn so that no two colored squares are on the same diagonal. A player who cannot make a move loses. For what values of N does the first player have a winning strategy? combinatoricsgamegame strategywinning strategy