Number of Ways to Partition a Rectangle with Restrictions

69 Views Asked by At

Given a problem identical to this: Tricky Rectangle Problem. If we were to add more yellow squares is it possible to calculate the total number of possible rectangles that do not contain any yellow squares efficiently? It seems if you scale the solution in the given link you will have to consider every possible combination of yellow squares.