Problem #PRU-35170

Problems Set theory and logic Algorithm Theory Game Theory Symmetric strategies

Problem

On a board of size \(8 \times 8\), two in turn colour the cells so that there are no corners of three coloured squares. The player who can’t make a move loses. Who wins with the right strategy?