Defective Chessboard Problem

The assignment involves solving the Defective Chessboard Problem by using dynamic
programming approach on a board of size 2^k×2^k where 2≤k≤15. Write the source code of
the algorithm in Python.
Additional notes: A defective chessboard (also known as tromino tiling problem) is a
chessboard that has one unavailable (defective) position. A triomino is an L shaped object that
can cover three squares of a chessboard. A triomino has four orientations. Place the triominoes
on the 2^k×2^k defective chessboard so that all non-defective positions are covered.
Below is an example of solving defective chessboard problem using divide and conquer
approach. Maybe can modify it and implements the dynamic programming approach to solve
this problem.
https://medium.com/@Polaris000/visualizing-the-defective-chessboard-problemaa5fc38b6e5e
Meanwhile, this is an example of dynamic programming that used to solve the other problem,
Tiling with Dominoes Problem. Quite different from defective chessboard problem where we
need to have one tile that is defective and fill the other tiles with trominos that can have 4
orientations. However, this might as well help to give more understanding on how dynamic
programming works.
https://www.geeksforgeeks.org/tiling-with-dominoes/