public class WolfGoatCabbage extends ExampleFD
We need to transfer the cabbage, the goat and the wolf from one bank of the river to the other bank. But there is only one seat available on his boat !
Furthermore, if the goat and the cabbage stay together as we are leaving on a boat, the goat will eat the cabbage. And if the wolf and the goat stay together as we are leaving, the wolf will eat the goat !
Modifier and Type | Field and Description |
---|---|
int |
numberInnerMoves
It specifies number of moves allowed (one move is from one river bank to the other)
|
Constructor and Description |
---|
WolfGoatCabbage() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes a program which finds the optimal trip
and load of the boat between the river banks so all
parties survive.
|
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
public int numberInnerMoves
public void model()
ExampleFD
public static void main(String[] args)
args
- no argument is used.Copyright © 2022. All rights reserved.