assignment1
Interface IDomain

All Known Implementing Classes:
CMapDomain

public interface IDomain

Describe interface IDomain here.


Method Summary
 double ActionCost(IState arg_state, CPair<IAction,IState> arg_pair)
           
 IState GetInitialState()
           
 double H(IState arg_state)
          A heuristic function used for something like A* search.
 boolean IsGoal(IState arg_state)
           
 double PathCost(java.util.Vector<IState> arg_Path)
           
 java.util.Vector<CPair<IAction,IState>> SuccessorFN(IState arg_state)
           
 

Method Detail

GetInitialState

IState GetInitialState()
Returns:
an IState value

SuccessorFN

java.util.Vector<CPair<IAction,IState>> SuccessorFN(IState arg_state)
Parameters:
arg_state - and IState value
Returns:
a Vector of CNodes, representing the possible successor states

IsGoal

boolean IsGoal(IState arg_state)
Parameters:
arg_state - an IState value
Returns:
a boolean value, true iff the given state is a goal of this problem

PathCost

double PathCost(java.util.Vector<IState> arg_Path)

ActionCost

double ActionCost(IState arg_state,
                  CPair<IAction,IState> arg_pair)

H

double H(IState arg_state)
A heuristic function used for something like A* search. Remember that the hueristic is constrained to be no more than the true distance/cost to a goal, but has no contraint as to being dynamic. That is, a constant value of 1 is allowable (just not useful).

Parameters:
arg_state - an IState value
Returns:
a double value, a guess at how far away a goal state is from arg_state.