|
Algorithm Development Kit 1.0 |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface IEvaluation
Common interface for game Tree algorithms seeking the best move given a particular game state and player making its move.
Since this is a two-person game which may need to look into the future, the current opponent is passed along for good measure.
| Method Summary | |
|---|---|
IGameMove |
bestMove(IGameState state,
IPlayer player,
IPlayer opponent)
For game state, player and opponent, return the best move. |
| Method Detail |
|---|
IGameMove bestMove(IGameState state,
IPlayer player,
IPlayer opponent)
If no move is even available, then null is returned.
state - Current game positionplayer - Current player making moveopponent - Opponent of player who will make counter moves
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||