Debian Codegraph @

tests/spec/unit/search/int_choice_2.mzn

raw
1 /***
2 --- !Test
3 solvers: [gecode, chuffed]
4 expected: !Result
5 solution: !Solution
6 q: [8, 4, 1, 3, 6, 2, 7, 5]
7 ***/
8
9 int: n = 8;
10
11 array [1..n] of var 1..n: q;
12
13 predicate
14 noattack(int: i, int: j, var int: qi, var int: qj) =
15 qi != qj /\
16 qi + i != qj + j /\
17 qi - i != qj - j;
18
19 constraint
20 forall (i in 1..n, j in i+1..n) (
21 noattack(i, j, q[i], q[j])
22 );
23
24 solve ::
25 int_search(
26 q,
27 input_order,
28 indomain_max,
29 complete
30 )
31 satisfy;