Uses of Class
game.MoveGenerator

Packages that use MoveGenerator

Package	Description
game
search
search.ab
search.mcts
search.mcts_lib

Uses of MoveGenerator in game

Methods in game that return MoveGenerator

Modifier and Type	Method	Description
MoveGenerator	MoveGenerator.clone()

Uses of MoveGenerator in search

Methods in search with parameters of type MoveGenerator

Modifier and Type	Method	Description
double	Minimax_noAB.iterativeDeepeningNoAlphaBeta(MoveGenerator gameState, Color currentColor, Color ourColor, int move)	Performs iterative deepening search using the Minimax algorithm without Alpha-Beta pruning.
double	Minimax_noAB.treeSearchNoAlphaBeta(MoveGenerator gameState, int depth, Color currentColor, Color ourColor, double value)	Performs the Minimax search without Alpha-Beta pruning.

Uses of MoveGenerator in search.ab

Methods in search.ab with parameters of type MoveGenerator

Modifier and Type	Method	Description
static double	Evaluation.getScoreWrapper(MoveGenerator moveGenerator, Color player, double depth)	Computes the score of the current game position for a specified player.
static double	Evaluation.getScoreWrapperAI(MoveGenerator moveGenerator, Color player, double depth, LinkedHashMap<Integer,List<Integer>> moves)	Computes the score of the current game position for a player considering opponent's moves.
static double	Evaluation.getScoreWrapperOld(MoveGenerator moveGenerator, Color player, String fen)	Computes the score of the current game position for a specified player in an old version for benchmarking.
double	Minimax_AB.iterativeDeepening(MoveGenerator gameState, double moveTimeLimit, Color ourColor)	Performs an iterative deepening search to find the best move score within the given time limit.
static void	Evaluation.orderMoves(LinkedList<Integer> moves, Color color, MoveGenerator game)	Orders moves in a list based on whether a move winning, capturing, and closeness to target row.
double	Minimax_AB.quiescenceSearch(MoveGenerator gameState, double alpha, double beta, Color currentColor, Color ourColor)	Performs a quiescence search to evaluate positions more accurately by only exploring capture moves.
double	Evaluation.rateMove(MoveGenerator gameState, Color color, int startPosition, int endPosition, int depth)	Rates a move in the game based on its impact on the game position for a specified player.
static double	Evaluation.ratePosition(MoveGenerator moveGenerator, Color color, int depth)	Rates the overall position of the game for a specified player.
static double	Evaluation.ratePositionAI(MoveGenerator moveGenerator, Color color, int depth, LinkedHashMap<Integer,List<Integer>> moves, Color currentColor)	Rates the overall position of the game for a player considering opponent's moves.
static double	Evaluation.ratePositionOld(MoveGenerator moveGenerator, Color color, String fen)	Rates the overall position of the game for a specified player in an old version for benchmarking.
double	Minimax_AB.treeSearch(MoveGenerator gameState, double alpha, double beta, double endTime, int depth, Color currentColor, Color ourColor)	Executes a recursive tree search with alpha-beta pruning to evaluate game positions and find the best possible move for the current player.

Uses of MoveGenerator in search.mcts

Methods in search.mcts with parameters of type MoveGenerator

Modifier and Type	Method	Description
MCTSNode	MCTS.expandAndReturnRandomNode(MCTSNode node, MoveGenerator moveGenerator, Color color, LinkedList<Integer> children)	Expands the given MCTS node by creating new child nodes for each possible move and returns one of the created child nodes at random.
int	MCTS.simulateToEnd(Color color, MoveGenerator moveGenerator, Color parentColor)	Simulates the game to the end using a probabilistic approach weighted by the number of possible moves or each player.
void	MCTS.treePolicy(MoveGenerator moveGenerator, MCTSNode node, Color color)	Executes the tree policy for the Monte Carlo Tree Search (MCTS) algorithm.
MCTSNode	MCTS.treeTraversal(double endtime, MCTSNode node, MoveGenerator moveGenerator)	Performs a tree traversal in the Monte Carlo Tree Search (MCTS) algorithm.
void	MCTSNode.updateNode(MoveGenerator moveGenerator)	Updates the node to determine if it has won in its position.

Uses of MoveGenerator in search.mcts_lib

Methods in search.mcts_lib with parameters of type MoveGenerator

Modifier and Type	Method	Description
int	MCTS_lib.runMCTS(MoveGenerator moveGenerator, Color color)	Runs the Monte Carlo Tree Search (MCTS) algorithm to determine the best move.