blob: c96a7516df35cc16b7e280a53d07c03459af515b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
package jrummikub.ai.fdsolver.constraint;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import jrummikub.ai.fdsolver.Constraint;
import jrummikub.ai.fdsolver.Propagator;
import jrummikub.ai.fdsolver.Satisfiability;
import jrummikub.ai.fdsolver.Var;
public class SumConstraint extends Constraint {
Var<Integer> x, y, z;
public SumConstraint(Var<Integer> x, Var<Integer> y, Var<Integer> z) {
this.x = x;
this.y = y;
this.z = z;
}
@Override
public Collection<Var<?>> getWatchedVars() {
return Arrays.<Var<?>> asList(x, y, z);
}
@Override
public Collection<Propagator> getPropagators(boolean negate) {
// TODO Auto-generated method stub
return Collections.emptyList();
}
@Override
public Satisfiability getSatisfiability() {
// HashSet<Integer> intersection = new HashSet<Integer>();
for (int xv : x.getRange()) {
for (int yv : y.getRange()) {
if (z.getRange().contains(xv + yv)) {
if (z.getRange().size() == 1 && x.getRange().size() == 1
&& y.getRange().size() == 1) {
return Satisfiability.TAUT;
} else {
return Satisfiability.SAT;
}
}
}
}
return Satisfiability.UNSAT;
}
}
|