Algorithm
Development Kit 1.0

algs.model.gametree
Interface IEvaluation

All Known Implementing Classes:
AlphaBetaEvaluation, AlphaBetaEvaluation, MinimaxEvaluation, MinimaxEvaluation, NegMaxEvaluation, NegMaxEvaluation

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.

Since:
1.0
Version:
1.0, 6/15/08
Author:
George Heineman

Method Summary
 IGameMove bestMove(IGameState state, IPlayer player, IPlayer opponent)
          For game state, player and opponent, return the best move.
 

Method Detail

bestMove

IGameMove bestMove(IGameState state,
                   IPlayer player,
                   IPlayer opponent)
For game state, player and opponent, return the best move.

If no move is even available, then null is returned.

Parameters:
state - Current game position
player - Current player making move
opponent - Opponent of player who will make counter moves

Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.