Package edu.columbia.cs.coms4701.search.informed.local

R&N ch 4.3-4.4: Informed search for problems in which only the final state, not the path to the state, matters.

See:
          Description

Interface Summary
AnnealingSchedule A simple function that returns a "temperature" controlling the probability of making suboptimal moves.
HillClimbingSearch<K extends AgentAction,S extends AgentState> Basic local search technique; in each step, the current node is replaced by the best neighbor.
LocalSearchAlgorithm<K extends AgentAction,S extends AgentState> A local search algorithm is appropriate when the *path* to a goal state does not matter.
SimulatedAnnealingSearch<K extends AgentAction,S extends AgentState> A version of stochastic hill climbing where some 'downhill' or non-best moves are allowed.
 

Package edu.columbia.cs.coms4701.search.informed.local Description

R&N ch 4.3-4.4: Informed search for problems in which only the final state, not the path to the state, matters.

Related Documentation