|
Class Summary |
| AIFactory |
Implementation of AIPlayerFactory - See http://antichess.mit.edu:8080/core/index.html |
| LookupTable |
The LookupTable represents an efficient hash table to Variations with
two properties that make a regular HashMap unsuitable:
- The LookupTable uses bounded memory, choosing to replace old
cells rather than expand. |
| NegativePieceHeuristic |
The PieceHeuristic maximizes the number of pieces controlled. |
| OptimizingAlphaBetaPlayer |
An ai player that uses alpha-beta pruning for some heuristic. |
| PawnWeightedHeuristic |
The PawnWeightedHeuristic computes a bunch of values to consider,
then ignores most of them because they don't actually help. |
| PawnWeightedPieceHeuristic |
The PawnWeightedHeuristic computes a bunch of values to consider,
then ignores most of them because they don't actually help. |
| PieceHeuristic |
The PieceHeuristic simply minimizes the number of piece controlled. |
| RandomPlayer |
An ai player that makes random moves. |
| ScaledPieceHeuristic |
The ScaledPieceHeuristic minimizes the fraction of pieces controlled. |
| Variation |
A Variation represents the sequence of optimal plays from a game
state. |