Package edu.columbia.cs.coms4701.search.uninformed

R&N ch 3: Uninformed search algorithms and strategies.

See:
          Description

Interface Summary
BreadthFirstSearchStrategy<K extends AgentAction,S extends AgentState> Search strategy in which the root node is expanded first, then all successors of the root node are expanded next, then their successors, etc.
DepthFirstSearchStrategy<K extends AgentAction,S extends AgentState> Search strategy that always expands the deepest node in the current fringe of the search tree.
DepthLimitedSearch<K extends AgentAction,S extends AgentState> A tree search with a predetermined depth limit.
IterativeDeepeningSearch<K extends AgentAction,S extends AgentState> A general strategy often used in combination with DepthLimitedSearch, which gradually increases the limit.
UniformCostSearchStrategy<K extends AgentAction,S extends AgentState> Like BreadthFirstSearchStrategy, but expands the node with lowest path cost, rather than the shallowest node.
 

Exception Summary
DepthCutoffSearchFailureException A search failure resulting from a depth cutoff in a depth limited search.
 

Package edu.columbia.cs.coms4701.search.uninformed Description

R&N ch 3: Uninformed search algorithms and strategies.

Related Documentation