MathDB
Avoid L-triominos

Source: Own. Malaysian SST 2023 P1

August 30, 2023
combinatorics

Problem Statement

Ivan has a m×nm \times n board, and he color some squares black, so that no three black squares form a L-triomino up to rotations and reflections. What is the maximal number of black squares that Ivan can color?
Proposed by Ivan Chan Kai Chin