Algorithm
Development Kit 1.0

Package algs.model.gametree

Core set of classes and interfaces to support Game Trees.

See:
          Description

Interface Summary
IComparator Defines a comparator function for scores on a gameTree board.
IEvaluation Common interface for game Tree algorithms seeking the best move given a particular game state and player making its move.
IGameMove A valid move in the GameTree.
IGameScore Each game state position requires some scoring function.
IGameState A valid representation of the state of a particular game with two players.
IPlayer A Player of the game.
 

Class Summary
AlphaBetaEvaluation Initiate AlphaBeta Evaluation over the given game state and ply.
MinimaxEvaluation Perform a MiniMax evaluation over a game state to the fixed ply depth.
MoveEvaluation Used to represent the Comparable score for a given Move.
NegMaxEvaluation Represents an Intelligent agent that uses the NegMax algorithm to select a move.
Pair Combines an IGameState position with a MoveEvaluation that produced the game state.
 

Package algs.model.gametree Description

Core set of classes and interfaces to support Game Trees. The known algorithms that operate over Game Trees in this package include:

When applying any of these search algorithms to a game tree one must provide an evaluation function.


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.