Proof Writing & Problem Solving · Easy problem

Induction shows that a $2^n \times 2^n$ board with any one square removed can be tiled by L-shaped trominoes (three squares each): split into four quarters and place one tromino at the centre. How many trominoes tile an $8 \times 8$ board with one square removed?