Package search

Class Minimax_noAB

java.lang.Object

search.AI

search.Minimax_noAB

public class Minimax_noAB
extends AI

An implementation of a Minimax Search for the game Jump Sturdy without Alpha-Beta Pruning,.

Field Summary

Fields

Modifier and Type	Field	Description
HashMap<String,Integer>	positionsHM

Constructor Summary

Constructors

Constructor	Description
Minimax_noAB()

Method Summary

Modifier and Type	Method	Description
int	getBestMoveNoAlphaBeta(String fen)	Finds the best move using the Minimax algorithm without Alpha-Beta pruning.
double	iterativeDeepeningNoAlphaBeta(MoveGenerator gameState, Color currentColor, Color ourColor, int move)	Performs iterative deepening search using the Minimax algorithm without Alpha-Beta pruning.
String	orchestrator(String fen, SearchConfig config)	Orchestrates the AI on the given FEN position and search configuration.
String	showConfig()	Returns the configuration of the AI.
double	treeSearchNoAlphaBeta(MoveGenerator gameState, int depth, Color currentColor, Color ourColor, double value)	Performs the Minimax search without Alpha-Beta pruning.

Methods inherited from class search.AI

toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Details

positionsHM

public HashMap<String,Integer> positionsHM

Constructor Details

Minimax_noAB

public Minimax_noAB()

Method Details

orchestrator

public String orchestrator(String fen,
 SearchConfig config)

Description copied from class: AI

Orchestrates the AI on the given FEN position and search configuration.

Specified by:

orchestrator in class AI

Parameters:

fen - The current position in FEN notation

config - The configuration object specifying the AI search parameters

Returns:

The best move determined by the search algorithm

showConfig

public String showConfig()

Description copied from class: AI

Returns the configuration of the AI.

Specified by:

showConfig in class AI

Returns:

The configuration object

getBestMoveNoAlphaBeta

public int getBestMoveNoAlphaBeta(String fen)

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.