edu.columbia.cs.coms4701.search.adversarial
Interface MinimaxFunction<K extends AgentAction,S extends GameState,P extends GameProblem<K,S>>

All Superinterfaces:
StateEvaluationFunction<K,S,P>
All Known Subinterfaces:
MinimaxFunctionWithHeuristic<K,S,P>

public interface MinimaxFunction<K extends AgentAction,S extends GameState,P extends GameProblem<K,S>>
extends StateEvaluationFunction<K,S,P>

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.

Version:
0.1

User: aaron Date: Sep 24, 2006 Time: 3:48:49 PM

Author:
aaron@cs
See Also:
"Russell & Norvig pp163-170"

Method Summary
 
Methods inherited from interface edu.columbia.cs.coms4701.search.adversarial.StateEvaluationFunction
evaluateStateForProblem