Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
34 lines
499 B
MiniZinc
34 lines
499 B
MiniZinc
/***
|
|
--- !Test
|
|
solvers: [gecode, chuffed]
|
|
expected: !Result
|
|
solution: !Solution
|
|
q: [1, 5, 8, 6, 3, 7, 2, 4]
|
|
***/
|
|
|
|
int: n = 8;
|
|
|
|
array [1..n] of var 1..n: q;
|
|
|
|
predicate
|
|
noattack(int: i, int: j, var int: qi, var int: qj) =
|
|
qi != qj /\
|
|
qi + i != qj + j /\
|
|
qi - i != qj - j;
|
|
|
|
constraint
|
|
forall (i in 1..n, j in i+1..n) (
|
|
noattack(i, j, q[i], q[j])
|
|
);
|
|
|
|
solve ::
|
|
int_search(
|
|
q,
|
|
input_order,
|
|
indomain_split,
|
|
complete
|
|
)
|
|
satisfy;
|
|
|
|
output [ show(q) ++ "\n" ];
|