| Interface | Description |
|---|---|
| AdversarialSearch<STATE,ACTION> |
Variant of the search interface.
|
| Game<STATE,ACTION,PLAYER> |
Artificial Intelligence A Modern Approach (3rd Edition): page 165.
A game can be formally defined as a kind of search problem with the following elements: S0: The initial state, which specifies how the game is set up at the start. PLAYER(s): Defines which player has the move in a state. ACTIONS(s): Returns the set of legal moves in a state. RESULT(s, a): The transition model, which defines the result of a move. TERMINAL-TEST(s): A terminal test, which is true when the game is over and false TERMINAL STATES otherwise. |
| Class | Description |
|---|---|
| AlphaBetaSearch<STATE,ACTION,PLAYER> |
Artificial Intelligence A Modern Approach (3rd Ed.): Page 173.
|
| IterativeDeepeningAlphaBetaSearch<STATE,ACTION,PLAYER> |
Implements an iterative deepening Minimax search with alpha-beta pruning and
action ordering.
|
| MinimaxSearch<STATE,ACTION,PLAYER> |
Artificial Intelligence A Modern Approach (3rd Edition): page 169.
|