|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use HillClimbingStrategy | |
---|---|
extended | contains more advanced search algorithms and the corresponding problem interfaces |
Uses of HillClimbingStrategy in extended |
---|
Classes in extended that implement HillClimbingStrategy | |
---|---|
class |
BestChoiceStrategy<T>
A hill climbing strategy which selects the best successor upon all successor states. |
class |
FirstChoiceStrategy<T>
A hill climbing strategy which selects the first successor which is better then the current state. |
Fields in extended declared as HillClimbingStrategy | |
---|---|
protected HillClimbingStrategy<T> |
HillClimbing.strategy
holds the strategy used during the search |
Methods in extended that return HillClimbingStrategy | |
---|---|
HillClimbingStrategy<T> |
HillClimbing.getStrategy()
This method returns the actual HillClimbingStrategy used during the search. |
Methods in extended with parameters of type HillClimbingStrategy | |
---|---|
void |
HillClimbing.setStrategy(HillClimbingStrategy<T> strategy)
This method replaces the used strategy by the given one. |
Constructors in extended with parameters of type HillClimbingStrategy | |
---|---|
HillClimbing(HillClimbingProblem<T> problem,
boolean minimum,
HillClimbingStrategy<T> strategy,
int sideSteps)
Creates a new hill climbing search, with the given problem, the direction given by the minimum flag and the allowed number of sideSteps. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |