lets say the sides of the big square are 50 units. i want to fit as much 3x3 and 2x2 squares inside of it as possible with the condition that N2x2=0.7 N3x3
I tried the sat solver in python but the computing time gets insane with just a 20x20 grid which is far away from my objective.
I was wondering if there is a more efficient way to go about it.
