MathDB
coloring squares on NxN board in turns, no 2 squares lie on same diagonal

Source: 2015 Latvia BW TST P9

December 16, 2022
combinatoricsgamegame strategywinning strategy

Problem Statement

Two players play the following game on a square of N×NN \times 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 NN does the first player have a winning strategy?
Back to ProblemsView on AoPS