edu.columbia.cs.coms4701.search.informed.local.searchalgorithms
Interface HillClimbingSearch<K extends AgentAction,S extends AgentState>

All Superinterfaces:
LocalSearchAlgorithm<K,S>

public interface HillClimbingSearch<K extends AgentAction,S extends AgentState>
extends LocalSearchAlgorithm<K,S>

Basic local search technique; in each step, the current node is replaced by the best neighbor.

Note that for consistency with our definition of EvaluationFunction, this should really be considered a HillDescent search.

Version:
0.1

User: aaron Date: Sep 11, 2006 Time: 11:42:02 PM

Author:
aaron@cs
See Also:
"Russell & Norvig p112"

Method Summary
 S getState()
          Returns the current best state.
 
Methods inherited from interface edu.columbia.cs.coms4701.search.informed.local.LocalSearchAlgorithm
getEvaluationFunction, search
 

Method Detail

getState

S getState()
Returns the current best state.

Returns:
a state