Package org.jacop.examples.fd
Class LatinSquare
- java.lang.Object
-
- org.jacop.examples.fd.ExampleFD
-
- org.jacop.examples.fd.LatinSquare
-
public class LatinSquare extends ExampleFD
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.8
-
-
Constructor Summary
Constructors Constructor Description LatinSquare()
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description static void
main(java.lang.String[] args)
It executes the program to solve the LatinSquare problem.void
model()
It specifies a standard way of modeling the problem.-
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
-
-
-
-
Method Detail
-
model
public void model()
Description copied from class:ExampleFD
It specifies a standard way of modeling the problem.
-
main
public static void main(java.lang.String[] args)
It executes the program to solve the LatinSquare problem.- Parameters:
args
- size of the problem
-
-