Package search
Class Minimax_noAB
java.lang.Object
search.AI
search.Minimax_noAB
An implementation of a Minimax Search for the game Jump Sturdy without Alpha-Beta Pruning,.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintFinds the best move using the Minimax algorithm without Alpha-Beta pruning.doubleiterativeDeepeningNoAlphaBeta(MoveGenerator gameState, Color currentColor, Color ourColor, int move) Performs iterative deepening search using the Minimax algorithm without Alpha-Beta pruning.orchestrator(String fen, SearchConfig config) Orchestrates the AI on the given FEN position and search configuration.Returns the configuration of the AI.doubletreeSearchNoAlphaBeta(MoveGenerator gameState, int depth, Color currentColor, Color ourColor, double value) Performs the Minimax search without Alpha-Beta pruning.
-
Field Details
-
positionsHM
-
-
Constructor Details
-
Minimax_noAB
public Minimax_noAB()
-
-
Method Details
-
orchestrator
Description copied from class:AIOrchestrates the AI on the given FEN position and search configuration.- Specified by:
orchestratorin classAI- Parameters:
fen- The current position in FEN notationconfig- The configuration object specifying the AI search parameters- Returns:
- The best move determined by the search algorithm
-
showConfig
Description copied from class:AIReturns the configuration of the AI.- Specified by:
showConfigin classAI- Returns:
- The configuration object
-
getBestMoveNoAlphaBeta
Finds the best move using the Minimax algorithm without Alpha-Beta pruning.- Parameters:
fen- The FEN string representing the current game state.- Returns:
- The best move as an integer.
-
iterativeDeepeningNoAlphaBeta
public double iterativeDeepeningNoAlphaBeta(MoveGenerator gameState, Color currentColor, Color ourColor, int move) Performs iterative deepening search using the Minimax algorithm without Alpha-Beta pruning.- Parameters:
gameState- The current game state.currentColor- The color of the player whose turn it is.ourColor- The color of our player.- Returns:
- The best score for the current game state.
-
treeSearchNoAlphaBeta
public double treeSearchNoAlphaBeta(MoveGenerator gameState, int depth, Color currentColor, Color ourColor, double value) Performs the Minimax search without Alpha-Beta pruning.- Parameters:
gameState- The current game state.depth- The maximum depth to search.currentColor- The color of the player whose turn it is.ourColor- The color of our player.value- The value for pruning.- Returns:
- The best score for the current game state.
-