MathDB

Given a positive integer

n

, an

n

-gun is a

2n

-mino that is formed by putting a

1 \times n

grid and an

n \times 1

grid side by side so that one of the corner unit squares of the first grid is next to one of the corner unit squares of the second grid. Find the minimum possible

k

such that it is possible to color the infinite planar grid with

k

colors such that any

n

-gun cannot cover two different squares with the same color.
Itf0501

Problem Statement