The Code linked below was created as a consequence of a given task, that required a general idea of how the Problem could be solved. In Pseudocode for that matter. The code overengineers this task, outputting a graphical representation of the solution using matplotlib
The following requirements were given

  • Input: the dimensions of a 2kx2k square of 1x1 fields and the position of an initially marked field
  • Output: The square described above filled with 3-Tile L-Shapes
  • Additional: The algorithm has to be divide-and-conquer

A deprecated version of a part of the code can be seen with a click onto the button below, Github might be the better choice