public static int minmaxJumping(Board board, Color computer, Color player, int deepth) {
if (deepth > 0) {
int result;
Position nextMoveFrom = null;
Position nextMoveTo = null;
Position nextTake = null;
if (computer == BLACK) {
result = Integer.MIN_VALUE;
} else {
result = Integer.MAX_VALUE;
}
for (Position turnFrom : Position.getAllPositions()) {
if (board.getColor(turnFrom) == computer) { // Every brick with the Color is removed
board.setColor(turnFrom, NONE);
for (Position turnTo : Position.getAllPositions()) {
if (turnTo != turnFrom && board.getColor(turnTo) == NONE) {
board.setColor(turnTo, computer); // On every possible position, a brick is laid.
if (board.isMill(turnTo, computer)) { // If with this position "turnTo" is a mill
for (Position takeAway : Position.getAllPositions()) {
if (board.getColor(takeAway) == player && !board.isMill(takeAway, player)) {
board.setColor(takeAway, NONE); // any opposing stone is taken away
int value =
minmaxJumping(
board, // other player has its turn
player,
computer,
(deepth - 1));
if (computer == BLACK) {
if (result < value) {
result = value;
nextMoveFrom = turnFrom;
nextMoveTo = turnTo;
nextTake = takeAway;
}
}
if (computer == WHITE) {
if (result > value) {
result = value;
nextMoveFrom = turnFrom;
nextMoveTo = turnTo;
nextTake = takeAway;
}
}
board.setColor(takeAway, player);
}
}
} else {
// no new mill with this move
// other player has its turn
int value = minmaxJumping(board, player, computer, (deepth - 1));
// Depending on what color is in the series, the minimum or the maximum is stored.
if (computer == BLACK) {
if (result < value) {
result = value;
nextMoveFrom = turnFrom;
nextMoveTo = turnTo;
nextTake = null;
}
}
if (computer == WHITE) {
if (result > value) {
result = value;
nextMoveFrom = turnFrom;
nextMoveTo = turnTo;
nextTake = null;
}
}
}
board.setColor(turnTo, NONE);
}
}
board.setColor(turnFrom, computer);
}
}
// The best turn is stored
Play.nextTurnFrom = nextMoveFrom;
Play.nextTurnTo = nextMoveTo;
Play.nextTake = nextTake;
return result;
} else {
// If the depth is reached, the current field rated
return Evaluation.evaluation(board);
}
}
