|
Algorithm Development Kit 1.0 |
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Class Summary | |
|---|---|
| AlphaBetaDebugNode | This node is used when depicting debugging information about an Alpha/Beta node in the game tree path finding search. |
| AlphaBetaEvaluation | Initiate AlphaBeta Evaluation over the given game state and ply. |
| AlphaPrune | This node is used when depicting debugging information when the AlphaBeta search algorithm prunes the search via an AlphaPrune. |
| MinimaxEvaluation | Initiate MinimaxEvaluation over the given game state and ply. |
| MinMaxNode | Represents a Min or Max node in the debugging output. |
| NegMaxEvaluation | Represents an Intelligent Tic Tac Toe playing agent that uses the NegMax algorithm to select a move. |
| NegMaxNode | Represents a NegMax node in the debugging output. |
| ScoreNode | This node is used when depicting debugging information about the score assigned to a node. |
Core set of classes for visualizing the progress of a game tree search algorithm.
|
Algorithm Development Kit 1.0 | ||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||