A square in row r, column c is black when r+c is even (row 1, column 1: 1+1=2, black) and white when r+c is odd. The full 6×6 grid has 18 black and 18 white squares.
(i) Plan A: row 2, column 3 has 2+3=5, odd, so it is white. Row 5, column 6 has 5+6=11, odd, so it is white. Both pillars stand on white squares, so the squares left are
18 black and 18−2=16 white
(ii) Two squares side by side always have different colours, so every carpet piece covers one black and one white square. Any set of pieces covers equal numbers of black and white squares. Plan A leaves 18 black but only 16 white, so it cannot be covered: two black squares would always be left.
(iii) Plan B: row 2, column 3 is white, and row 5, column 5 has 5+5=10, even, so it is black. The squares left are 17 black and 17 white. Equal counts are needed but do not by themselves prove a tiling, so we find one. The figure shows Plan B covered with 34÷2=17 pieces. So yes, Plan B can be covered.
