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

All Superinterfaces:
StateEvaluationFunction<K,S,P>

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

A node evaluation function that returns an estimated utility from a given position.

This is a tagging interface -- the distinction between a MinimaxFunction and a HeuristicStateEvaluationFunction is in how they operate, not in the methods they implement.

Such a function could simply call "MinimaxFunction", but the idea behind a heuristic evaluation is that it should save time as compared to an exhaustive minimax search.

Evaluation functions should order terminal states in the same way as the true utility function.

Version:
0.1

User: aaron Date: Sep 24, 2006 Time: 3:54:55 PM

Author:
aaron@cs
See Also:
"Russell & Norvig p171"

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