The ‘Mondrian Tiling’ problem is a particular class of constraint optimization problem where a square grid is covered with some non-overlapping integer dimension rectangles, which must not be pairwise congruent. The ...