I have been playing around with a simple n-queens model in MiniZinc: include "globals.mzn"; int: n_queens = 8; array[1..n_queens] of var 1..n_queens: queens; constraint alldifferent(quee...

I'm currently working on MiniZinc, and i have been running my models with the two solvers integrated in MiniZinc: Gecode and Chuffed. I've been running it in the IDE, but i am aware that it can be ...

I'm trying to understand MiniZincs geost constraint, which is described in the packing constraint section of the docs. I'm trying to implement 2D packing of rectangles with rotation: So I'd like to...

I'm new to constraint programming. I imagine this is an easy problem but I can't wrap my head around it. Here's the problem: We have multiple machines (N), each with a limited resource (let's say...

The MiniZinc constraint solver allows to express cardinality constraints very easily using the built-in sum() function: % This predicate is true, iff 2 of the array % elements are true predicate e...

Let's say I want to count the number of 80 element subsets of {1,2,..100} such that their sum is 3690. I have the following model: array[1..100] of var 0..1: b; constraint (sum (i in 1..100) (i*...

I have a problem that could be boiled down to finding a way of mapping a triangular matrix to a vector skipping the diagonal. Basically I need to translate this C++ code using the Gecode libraries ...

To solve a set of Boolean equations, I am experimenting with the Constraint-Programming Solver MiniZinc using the following input: % Solve system of Brent's equations modulo 2 % Matrix dimensions...

Please can you help optimize this working MiniZinc code: Task: There is a conference which has 6x time slots. There are 3 speakers attending the conference who are each available at certain slots....

I'm trying to adapt an already solved constraint programming problem by Hakan Kjellerstrand (@hakankless) and could do with some help please. Original solved problem: There are 6 public speakers a...