Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2025-part-02 — 186 problems (EN–VI) Question 90

Math Olympiad Vault · MathNet 2025-part-02 — 186 problems (EN–VI)

Question 90

An $8 \times 8$ chessboard is initially colored in a checkerboard pattern. Dark, semi-transparent L-shaped tiles, each covering three cells, can be placed on the board. To make the entire board a uniform shade, each white square must be covered by exactly one more layer of tiles than each black square. What is the minimum number of tiles required to make the board uniform in tone?