Question 15
David has unlimited O-tetrominoes (left) and V-trominoes (right).
He places pieces along the grid lines to cover a board completely, with no overlap and no part outside. The following $4\times4$ example uses four V-trominoes.
For a $9\times18$ board, what is the minimum number of V-trominoes needed? Prove that fewer are impossible and illustrate a placement achieving the minimum.
Additional original answer grid:
He places pieces along the grid lines to cover a board completely, with no overlap and no part outside. The following $4\times4$ example uses four V-trominoes.
For a $9\times18$ board, what is the minimum number of V-trominoes needed? Prove that fewer are impossible and illustrate a placement achieving the minimum.
Additional original answer grid: