Problem #PRU-115449

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Combinatorics Dissections, partitions, covers and tilings Tilings with ordinary and domino tiles

13–16 4.0

Problem

What is the smallest number of ‘L’ shaped ‘corners’ out of 3 squares that can be marked on an $8 \times 8$ square grid, so that no more ’corners’ would fit?

To see the solution register and get verified.