Uses of Enum Class
game.Color

Packages that use Color

Package	Description
app
benchmark.simulation
game
search
search.ab
search.mcts
search.mcts_lib

Uses of Color in app

Methods in app with parameters of type Color

Modifier and Type	Method	Description
String	Player.getMove(String fen, Color color)	Gets a valid move from the player.

Uses of Color in benchmark.simulation

Fields in benchmark.simulation declared as Color

Modifier and Type	Field	Description
final Color	ConnectionSimulation.GameResult.color
final Color	Simulation.GameResult.color

Constructors in benchmark.simulation with parameters of type Color

Modifier	Constructor	Description
	GameResult(int number, Color color, ArrayList<Integer> depths)
	GameResult(int number, Color color, ArrayList<Integer> depths)

Uses of Color in game

Methods in game that return Color

Modifier and Type	Method	Description
Color	MoveGenerator.getColor(char c)	Get the color from a character representation.
Color	MoveGenerator.getColorAtPosition(int position)	Get the piece color at a specific position on the board.
Color[][]	MoveGenerator.getColorBoard()
static Color	Color.valueOf(String name)	Returns the enum constant of this class with the specified name.
static Color[]	Color.values()	Returns an array containing the constants of this enum class, in the order they are declared.

Methods in game with parameters of type Color

Modifier and Type	Method	Description
boolean	MoveGenerator.doesBaseRowContainColor(Color color, int rowToCheck)	Checks if a specific row on the board contains any pieces of a given color.
LinkedHashMap<Integer,List<Integer>>	MoveGenerator.generateAllPossibleMoves(Color color)	Generates all possible moves for a specific color.
LinkedHashMap<Integer,List<Integer>>	MoveGenerator.generateAllPossibleMovesCaptures(Color color)	Generates all possible capturing moves for a specific color.
LinkedHashMap<Integer,List<Integer>>	MoveGenerator.generateMaxOnePossibleMoveForAI(Color color)	Generates a maximum of one possible move for a given color.
boolean	MoveGenerator.getWinner(LinkedHashMap<Integer,List<Integer>> moves, Color currPlayer)	Determines the winner for the Monte Carlo Tree Search (MCTS) strategy (only use when confirmed that game is over).
boolean	MoveGenerator.isGameOver(Color color)	Checks if the game is over for a specific color based on current board state.
boolean	MoveGenerator.isGameOver(String move, Color color)	Checks if the game is over for a specific color after a given move.
boolean	MoveGenerator.isGameOver(LinkedHashMap<Integer,List<Integer>> moves, Color color)	Checks if the game is over for a specific color based on available moves.
int	MoveGenerator.isGameOverMCTS(LinkedHashMap<Integer,List<Integer>> moves, Color color)	Checks if the game is over for the Monte Carlo Tree Search (MCTS) strategy and returns the result.
boolean	MoveGenerator.isValidMove(int move, Color pieceColor)	Checks if a move is valid for a piece of the given color.
boolean	MoveGenerator.isWinForMCTS(Color color)	Checks if the game is a win for the Monte Carlo Tree Search (MCTS) strategy.
void	MoveGenerator.setColorBoard(Color[][] givenColorBoard)	Set the color board.

Uses of Color in search

Methods in search with parameters of type Color

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 Color in search.ab

Methods in search.ab with parameters of type Color

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.
static void	Evaluation.orderMovesOld(LinkedList<Integer> moves, Color color)	Orders moves in a list in an old version for benchmarking based on whether a move winning 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 Color in search.mcts

Methods in search.mcts with parameters of type Color

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.
void	MCTS.propagateDataToRoot(MCTSNode node, int reward, Color colorOfExpandedPlayer)	Propagates the results of a simulation back up to the root of the Monte Carlo Tree Search (MCTS) tree.
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.

Constructors in search.mcts with parameters of type Color

Modifier	Constructor	Description
	MCTSNode(Color color)	Constructs an MCTSNode Root node only needing the Color as a parameter
	MCTSNode(MCTSNode parent, int move, Color color)	Constructs any MCTSNode with a specified parent, move, move generator, and color.

Uses of Color in search.mcts_lib

Methods in search.mcts_lib with parameters of type Color

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.