//
// How many dominos are there?
// Expressed as a CP 
//
// Can we prove this is correct using a counting argument?
//
import org.chocosolver.solver.Model;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.constraints.IIntConstraintFactory.*;
import org.chocosolver.solver.search.strategy.Search;

public class Domino3 {

    public static void main(String args[]) {
	Model model = new Model("domino3");
	Solver solver = model.getSolver();
	//IntVar v1     = model.intVar("v1",0,6);
	IntVar v2     = model.intVar("v2",0,6);
	IntVar v1     = model.intVar("v1",0,6);
	
	model.arithm(v1,"<=",v2).post();
	
	while(solver.solve())
	    System.out.println("["+v1.getValue() +" : "+ v2.getValue() +"]");

	//System.out.println(solver.getMeasures());
    }
}
//
// (a) why are dominos enumerated in this order?
//     - solver.setSearch(Search.inputOrderLBSearch(v1,v2));
// (b) So, how many solutions?
//