|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface MinimaxFunction<K extends AgentAction,S extends GameState,P extends GameProblem<K,S>>
A function which evaluates a state in a game tree and returns an exact minimax value, i.e. the utility of the state, assuming that all players play optimally from that state forward.
This is a tagging interface -- the distinction between a MinimaxFunction and a HeuristicStateEvaluationFunction is in how they operate, not in the methods they implement.
The minimax value of a terminal state is simply its utility.
Note that alpha-beta search is simply a refined implementation of MinimaxFunction.
Method Summary |
---|
Methods inherited from interface edu.columbia.cs.coms4701.search.adversarial.StateEvaluationFunction |
---|
evaluateStateForProblem |
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |