MathDB

Chesslike squares with a Connect Four condition

Source: 3rd Memorial Mathematical Competition "Aleksandar Blazhevski - Cane"- Junior D1 P2/ Senior D1 P1

January 17, 2022

combinatoricsboardColoringchesslikemaximum

Problem Statement

6 \times 6

board is given such that each unit square is either red or green. It is known that there are no

4

adjacent unit squares of the same color in a horizontal, vertical, or diagonal line. A

2 \times 2

subsquare of the board is chesslike if it has one red and one green diagonal. Find the maximal possible number of chesslike squares on the board.
Proposed by Nikola Velov

Back to Problems View on AoPS