public class LatinSquare extends ExampleFD
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.
Modifier and Type | Field and Description |
---|---|
int |
n
The size of the latin square.
|
Constructor and Description |
---|
LatinSquare() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program to solve the LatinSquare problem.
|
void |
model()
It specifies a standard way of modeling the problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
Copyright © 2022. All rights reserved.