Im trying to implement a function in python that tiles a 2^m x 2^m board (that has one square removed) with triominoes (each triomino makes up 3 squares and is shaped like an L)

The base case is that for a 2x2 board with one square removed, it just needs one triomino

The recursive case is to divide the board into 4 sections and you have to recursively tile these 4 sections. Anything that has already been covered w/ triominos should be viewed as a removed square.

This pic is an example

The function I need to implement has the parameters m, row-of-removed-square, and column-of-removed-square.

I need to build the board recursively, which is a list of lists.

I have this:

board = [[0] * 2**m for i in range(2**m)].

How can I solve this??