Package org.jacop.examples.fd
Class LatinSquare
java.lang.Object
org.jacop.examples.fd.ExampleFD
org.jacop.examples.fd.LatinSquare
It solves a Latin Square problem.
LatinSquare problem consists of filling the square of size n by n with numbers 1..n in such a way that every row and column does not contain two numbers of the same value.
QuasiGroupCompletion example provides possibility to impose initial conditions on the values of pre-assigned cells.
- Version:
- 4.10
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.jacop.examples.fd.ExampleFD
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
-
Field Details
-
n
public int nThe size of the latin square.
-
-
Constructor Details
-
LatinSquare
public LatinSquare()
-
-
Method Details