|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectalgs.model.searchtree.debug.AStarSearch
public class 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. Ties are broken randomly, except when one of the tied nodes is a goal node.
Field Summary | |
---|---|
int |
numClosed
|
int |
numMoves
|
int |
numOpen
|
Constructor Summary | |
---|---|
AStarSearch(IScore sf)
Prepare an A* search using the given scoring function. |
Method Summary | |
---|---|
IDebugSearch |
debug(IDebugSearch debugger)
Set the debugger to use when searching (or null to turn off). |
Solution |
search(INode initial,
INode goal)
Initiate the search for the target state. |
void |
storageType(int type)
Determine structure to use for storing CLOSED set. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public int numMoves
public int numOpen
public int numClosed
Constructor Detail |
---|
public AStarSearch(IScore sf)
sf
- static evaluation functionMethod Detail |
---|
public void storageType(int type)
public IDebugSearch debug(IDebugSearch debugger)
public Solution search(INode initial, INode goal)
search
in interface ISearch
initial
- the initial board stategoal
- the final board state
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |