public class NonTransitiveDice extends ExampleFD
Modifier and Type | Field and Description |
---|---|
int |
currentBest
It specifies the currently best solution which is a bound
for the next solution.
|
int |
noDices
It specifies number of dices in the problem.
|
int |
noSides
It specifies number of sides for each dice in the problem.
|
boolean |
reuseOfNumbers
If true then faces on non consequtive faces can be the same.
|
ArrayList<Constraint> |
shavingConstraints
It contains constraints which can be used for shaving guidance.
|
Constructor and Description |
---|
NonTransitiveDice() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program solving non transitive dice problem using
two different methods.
|
void |
model()
It specifies a standard way of modeling the problem.
|
boolean |
searchSpecial()
It executes a specialized search to find a solution to this problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
public int noDices
public int noSides
public int currentBest
public ArrayList<Constraint> shavingConstraints
public boolean reuseOfNumbers
public void model()
ExampleFD
public boolean searchSpecial()
public static void main(String[] args)
args
- the first argument specifies number of dices, the second argument specifies the number of sides of each dice.Copyright © 2015. All rights reserved.