PyCSP³

durations, successors, quantities, horizon, capacities = data
nJobs = len(durations)

# s[i] is the starting time of the ith job
s = VarArray(size=nJobs, dom=range(horizon))

satisfy(
   # job precedence constraints
   [
     s[i] + durations[i] <= s[j]
       for i in range(nJobs) for j in successors[i]]
   ],

   # cumulative resource constraints
   [
      Cumulative(
         Task(
            origin=s[i],
            length=durations[i],
            height=quantities[i][k]
         ) for i in range(nJobs)
      ) <= capacity for k, capacity in enumerate(capacities)
   ]
)

minimize(s[-1])

words, transitions, n = data
M = MDD(transitions)

# x[i][k] is the kth letter (0-A, 1-C, 2-G, 3-T) of the ith word
x = VarArray(size=[n, 8], dom=range(4))

satisfy(
   # each word must be well-formed
   [x[i] in words for i in range(n)],

   # ordering words  tag(symmetry-breaking)
   LexIncreasing(x, strict=True),

   # ensuring the validity of any pair of words
   [x[i] + x[j] in M for i, j in combinations(n, 2)]
)

width, height, boxes = data
nBoxes = len(boxes)

# x[i] is the x-coordinate where is put the ith box (rectangle)
x = VarArray(size=nBoxes, dom=range(width))

# y[i] is the y-coordinate where is put the ith box (rectangle)
y = VarArray(size=nBoxes, dom=range(height))

satisfy(
   # unary constraints on x
   [x[i] + boxes[i].width <= width for i in range(nBoxes)],

   # unary constraints on y
   [y[i] + boxes[i].height <= height for i in range(nBoxes)],

   # no overlap on boxes
   NoOverlap(
      origins=[(x[i], y[i]) for i in range(nBoxes)],
      lengths=boxes
   )
)

n, m, d, k = data or (9, 4, 3, 3)

# x[i][j] is the jth value of the ith vector
x = VarArray(size=[n, m], dom=range(d))

satisfy(
   # ensuring a Hamming distance of at least 'k' between any two vectors
   [Hamming(row1, row2) >= k for row1, row2 in combinations(x, 2)],

   # tag(symmetry-breaking)
   LexIncreasing(x)
)

nGroups, size, nWeeks, nPlayers = data

# g[w][p] is the group admitting on week w the player p
g = VarArray(size=[nWeeks, nPlayers], dom=range(nGroups))

satisfy(
   # ensuring that two players don't meet more than one time
   [
      If(
         g[w1][p1] == g[w1][p2],
         Then=g[w2][p1] != g[w2][p2]
      ) for w1, w2 in combinations(nWeeks, 2) 
        for p1, p2 in combinations(nPlayers, 2)
   ],

   # respecting the size of the groups
   [
      Cardinality(
         g[w],
         occurrences={i: size for i in range(nGroups)}
      ) for w in range(nWeeks)
   ]
)

n = data

# x[i] is the row where is put the ith mark (on the ith column)
x = VarArray(size=n, dom=range(n))

satisfy(
   # all marks are on different rows (and columns)
   AllDifferent(x),

   # all displacement vectors between the marks must be different
   [
     AllDifferent(x[i] - x[i + d] for i in range(n - d)) for d in range(1, n - 1)
   ]
)