clpfd – Tarik Billa

Prolog Constraint Processing : Packing Squares

September 12, 2023 by Tarik

For each square, define X and Y variables that denote the upper left corner. These variable will have domains 1..10-L, where L is the length of the square. If you set the domain to 1..10, the squares may be placed partly outside your 10×10 rectangle. Then you can post constraints for each pair of rectangles … Read more

Tennis match scheduling

June 8, 2023 by Tarik

Preface In Prolog, CLP(FD) constraints are the right choice for solving such scheduling tasks. See clpfd for more information. In this case, I suggest using the powerful global_cardinality/2 constraint to restrict the number of occurrences of each round, depending on the number of available courts. We can use iterative deepening to find the minimal number of admissible … Read more