Reimplemented AI (old one was too slow)

git-svn-id: svn://sunsvr01.isp.uni-luebeck.de/swproj13/trunk@443 72836036-5685-4462-b002-a69064685172

1 files changed, 0 insertions, 51 deletions

diff --git a/src/jrummikub/ai/fdsolver/constraint/SumConstraint.java b/src/jrummikub/ai/fdsolver/constraint/SumConstraint.java
deleted file mode 100644
index c96a751..0000000
--- a/src/jrummikub/ai/fdsolver/constraint/SumConstraint.java
+++ /dev/null
@@ -1,51 +0,0 @@
-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;
-	}
-}