|
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.MinimaxEvaluation
public class MinimaxEvaluation
Initiate MinimaxEvaluation over the given game state and ply. Uses dotty debugging output for viewing. Note that the implementation provided here is quite different from the non-debug version, since its aim is not for speed but for the accurate portrayal of the path finding algorithm as it executes.
Constructor Summary | |
---|---|
MinimaxEvaluation(int ply)
Create an evaluator with the given state. |
Method Summary | |
---|---|
IGameMove |
bestMove(IGameState state,
IPlayer player,
IPlayer opponent)
Initiates the MiniMax 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 MinimaxEvaluation(int ply)
bestMove
is invoked.
ply
- Depth to search.Method Detail |
---|
public IGameMove bestMove(IGameState state, IPlayer player, IPlayer opponent)
bestMove
in interface IEvaluation
state
- Game state being evaluatedplayer
- The player making the next moveopponent
- The player's opponentpublic 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 |