Question 32
On the $8 \times 8$ board, L-shaped tromino tiles (each tile covers exactly three cells forming an L) have to be placed in such a way that each tile covers exactly three cells of the board and the tiles cannot overlap.
What is the least possible number of tromino tiles that one can place on the board so that no additional tromino tile can be placed afterwards?
What is the least possible number of tromino tiles that one can place on the board so that no additional tromino tile can be placed afterwards?