org.xcsp.modeler.problems.AllInterval Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of xcsp3-tools Show documentation

Java Tools for parsing XCSP3 instances, compiling JvCSP3 models, and checking solutions. For more information about XCSP3, follow www.xcsp.org

The newest version!

/**
1 * AbsCon - Copyright (c) 2017, CRIL-CNRS - [email protected]
 * 
 * All rights reserved.
 * 
 * This program and the accompanying materials are made available under the terms of the CONTRAT DE LICENCE DE LOGICIEL LIBRE CeCILL which accompanies this
 * distribution, and is available at http://www.cecill.info
 */
package org.xcsp.modeler.problems;

import org.xcsp.common.IVar.Var;
import org.xcsp.modeler.api.ProblemAPI;

/**
 * Problem described at http://www.csplib.org/Problems/prob007/ 

 * For order 8, 9, 10, 11 and 12, there are respectively 40, 120, 296, 648 and 1328 solutions.
 * 
 */
public class AllInterval implements ProblemAPI {

	int n; // order

	@Override
	public void model() {
		Var[] x = array("x", size(n), dom(range(n)), "x[i] is the ith value of the series");
		Var[] y = array("y", size(n - 1), dom(range(1, n)), "y[i] is the distance between x[i] and x[i+1]");

		allDifferent(x);
		allDifferent(y);
		forall(range(n - 1), i -> equal(y[i], dist(x[i], x[i + 1])));

		block(() -> {
			lessThan(x[0], x[n - 1]);
			lessThan(y[0], y[1]);
		}).tag(SYMMETRY_BREAKING);
	}
}