this repo has no description
dekker.one
1int: n;
2array [1..n] of var 1..n: q; % queen in column i is in row q[i]
3
4include "alldifferent.mzn";
5
6constraint alldifferent(q); % distinct rows
7constraint alldifferent([ q[i] + i | i in 1..n]); % distinct diagonals
8constraint alldifferent([ q[i] - i | i in 1..n]); % upwards+downwards
9
10% search
11solve :: int_search(q, first_fail, indomain_min)
12 satisfy;
13output [ if fix(q[j]) == i then "Q" else "." endif ++
14 if j == n then "\n" else "" endif | i,j in 1..n]