Algorithm
Development Kit 1.0

Package algs.model.searchtree

Core set of classes to support Search Trees.

See:
          Description

Interface Summary
IMove A valid move in the Search Tree.
INode A valid representation of the node within a search tree.
INodeSet Defines an interface by which sets of INode objects are accessed.
IScore The scoring function returns an int value given a board state.
ISearch Common interface for all search algorithms over a search tree.
 

Class Summary
AStarSearch Given an initial state and a target goal state, expand successors, always choosing to expand the node in the OPEN list whose evaluation is the smallest.
BreadthFirstSearch Given an initial state and a target goal state, expand in breadth-first manner all available moves until the target goal state is reached.
ClosedStates Maintains the set of closed states in ordered fashion, so the state with the lowest evaluation function can be removed.
DepthFirstSearch Given an initial state, a target goal state, expand in breadth-first manner all available moves until the target goal state is reached.
DepthTransition Records the depth of the transition between board states.
Solution Records the solution for a search from an initial state to a solved goal state.
Transition Stores the move and the previous state that was present when the move was made.
 

Package algs.model.searchtree Description

Core set of classes to support Search Trees. The known algorithms that operate over Game Trees in this package include:


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.