Proof Writing & Problem Solving · Easy problem

A $7 \times 7$ board is coloured like a chessboard, with dark corner cells. What is the largest number of $1 \times 2$ dominoes (each covering two edge-adjacent cells) that can be placed on the board without overlapping?