Expand description
This library provides a generic interface to the Monte Carlo Tree Search (MCTS) algorithm. It can be used as a general game playing agent for two-player board games.
Structs
This struct provides metrics for the types of nodes in the search tree.
This struct is the main launch point for this crate. It holds the state of execution for the MCTS algorithm. Use it’s associated methods to operate the search and tune performance.
Enums
This enum describes the result of a game. The result should depict the outcome relative to the current player.
Traits
This trait describes an allowed move for a game state. This type is passed to the “make” function to produce the next game state. The algorithm keeps track of all allowed actions for each game state that is visited. Limit the size of this type and prefer a contiguous memory layout for best performance (e.g. enum, integer).
This trait describes the current state of the game from which to begin searching for the best move.
This trait describes the players in the game. For now it should be a two-state like a boolean.