A B C D E F G H I K L M N O P Q R S T U V

H

h(T) - Method in interface core.HeuristicProblem
This method computes the proximity of the given state to a goal.
hash - Variable in class basic.DepthFirstSearch
holds the set used for duplicate handling
hash - Variable in class basic.DepthLimitedSearch
holds the set used for duplicate handling
hash - Variable in class basic.IterativeDeepeningAStar
holds the map used for duplicate handling
hash - Variable in class basic.IterativeDeepeningSearch
holds the map used for duplicate handling
hash - Variable in class core.DirectedSearch
holds the set used for duplicate handling
heuristicProblem - Variable in class core.BestFirstSearch
holds a reference to the problem to be solved of the actual type
HeuristicProblem<T> - Interface in core
This is the base of all problems which can be solved in an heuristic search.
HillClimbing<T> - Class in extended
The hill climbing algorithm is simple local search able to solve any problem implementing the extended.HillClimbingProblem interface.
HillClimbing(HillClimbingProblem<T>) - Constructor for class extended.HillClimbing
Creates a new hill climbing search, with the given problem.
HillClimbing(HillClimbingProblem<T>, boolean, HillClimbing.EStrategy) - Constructor for class extended.HillClimbing
Creates a new hill climbing search, with the given problem and the direction given by the minimum flag.
HillClimbing(HillClimbingProblem<T>, boolean, HillClimbing.EStrategy, int) - Constructor for class extended.HillClimbing
Creates a new hill climbing search, with the given problem, the direction given by the minimum flag and the allowed number of sideSteps.
HillClimbing(HillClimbingProblem<T>, boolean, HillClimbingStrategy<T>, int) - Constructor for class extended.HillClimbing
Creates a new hill climbing search, with the given problem, the direction given by the minimum flag and the allowed number of sideSteps.
HillClimbing(HillClimbingProblem<T>, HillClimbing.EStrategy) - Constructor for class extended.HillClimbing
Creates a new hill climbing search, with the given problem and the selected strategy.
HillClimbing.EStrategy - Enum in extended
Enumeration to select one of the two default hill climbing strategies.
HillClimbingProblem<T> - Interface in extended
This is the base of all problems which can be solved with the hill climbing search.
HillClimbingStrategy<T> - Interface in extended
This is the base of all strategies for the hill climbing search.

A B C D E F G H I K L M N O P Q R S T U V