Finding all the Combinations - N Rectangles inside the Square
4
I am a beginner in Constraint Programming using Minizinc and I need help from experts in the field. How can I compute all the possible combinations: 6 Rectangles inside the Square (10x10) using Minizinc? Considering that the RESTRICTIONS of the problem are: 1) No Rectangle Can Overlap 2) The 6 rectangles may be vertical or horizontal OUTPUT: 0,1,1,0,0, . . . , 0,0,6,6,6 1,1,1,0,0, . . . , 0,0,0,4,4 0,0,5,5,0, . . . , 0,0,1,1,1 0,0,0,2,2, . . . , 0,0,0,0,0 0,0,0,0,2, . . . , 0,0,0,0,0 6,6,6,0,0, . . . , 0,4,4,4,0 Continue Combination...
constraint-programming minizinc
...