public class FittingNumbers extends ExampleFD
Find how many copies of each numbers to take that its sum is equal to one of the specified domain. 520, 247, 2626, 2119, 520, 2054, 1976, 1209, 1118, 1287, 1040, 741, 390, 2691, 2717, -1000
Constructor and Description |
---|
FittingNumbers() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program to solve simple Kakro puzzle.
|
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.