|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectalgs.model.gametree.debug.AlphaBetaEvaluation
public class AlphaBetaEvaluation
Initiate AlphaBeta Evaluation over the given game state and ply.
This implementation is quite different from the non-debug version; this was done because of the convoluted nature of the debugging code to generate the game trees. After execution, the debug information is properly invoked on the provided IDebugSearch interface.
Constructor Summary | |
---|---|
AlphaBetaEvaluation(int ply)
Create an evaluator with the given state. |
Method Summary | |
---|---|
IGameMove |
bestMove(IGameState s,
IPlayer player,
IPlayer opponent)
Initiates the AlphaBeta computations by determining the maximum number of moves in advance to look. |
void |
debug(IDebugSearch debug)
Install debugger to use. |
java.lang.String |
toString()
Expose board state as string (useful for debugging purposes). |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public AlphaBetaEvaluation(int ply)
bestMove
is invoked.
ply
- Depth to search.Method Detail |
---|
public IGameMove bestMove(IGameState s, IPlayer player, IPlayer opponent)
The original game state is copied prior to being processed so no external effect occurs. This implementation is derived from NegMax and selects moves accordingly.
bestMove
in interface IEvaluation
s
- Game stateplayer
- The player making the next moveopponent
- The player's opponent.public java.lang.String toString()
toString
in class java.lang.Object
public void debug(IDebugSearch debug)
debug
-
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |