wfolsom/cs8803p4
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

- Changed the rules. Now tiles can only be placed next to existing tiles. Unless the board is empty.

Browse Source
This commit is contained in:
Marshall
2012-04-29 17:11:11 -04:00
parent c06f7ab38e
commit e012f17b33
3 changed files with 168 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files

172
src/model/comPlayer/generator/AlphaBetaMoveGenerator.java
View File

@@ -11,104 +11,24 @@ import model.SearchResult;
import org.apache.log4j.Logger;
public class AlphaBetaMoveGenerator implements MoveGenerator {
private static final int DEFAULT_RECURSIVE_PLAYS = 1;
private static final Logger LOGGER = Logger
.getLogger(AlphaBetaMoveGenerator.class.getName());
private static final int DEFAULT_RECURSIVE_PLAYS = 2;
private final BoardScorer scorer = new BoardScorer();
private final ValidMoveGenerator validMoveGenerator = new ValidMoveGenerator();
@Override
public Move genMove(Board board, boolean asHuman) {
if (!asHuman) {
return getMaxValue(board, asHuman, DEFAULT_RECURSIVE_PLAYS * 2, Integer.MIN_VALUE,
Integer.MAX_VALUE).move;
return getMaxValue(board, asHuman, DEFAULT_RECURSIVE_PLAYS * 2,
Integer.MIN_VALUE, Integer.MAX_VALUE).move;
} else {
return getMinValue(board, asHuman, DEFAULT_RECURSIVE_PLAYS * 2, Integer.MIN_VALUE,
Integer.MAX_VALUE).move;
return getMinValue(board, asHuman, DEFAULT_RECURSIVE_PLAYS * 2,
Integer.MIN_VALUE, Integer.MAX_VALUE).move;
}
}
private SearchResult getMaxValue(Board board, boolean asHuman, int recursionLevel,
int alpha, int beta) {
if (recursionLevel < 1) {
return new SearchResult(Move.NONE,scorer.getScore(board));
}
List<Move> validMoves = validMoveGenerator.genMoves(board, asHuman,
MoveGenerator.ALL_MOVES);
SearchResult bestResult = new SearchResult(Move.NONE,Integer.MIN_VALUE);
if (validMoves.size() == 0) {
return bestResult;
}
for (Move nextMove : validMoves) {
Board nextBoard = new Board(board);
if (!nextBoard.playTile(nextMove.getCell(), nextMove.getColor())) {
throw new RuntimeException(
"Illegal move attempted during search!");
}
SearchResult searchResult = new SearchResult(nextMove,getMinValue(nextBoard, !asHuman, recursionLevel - 1,
alpha, beta).score);
if (searchResult.compareTo(bestResult) > 0) {
bestResult = searchResult;
}
if (bestResult.score >= beta) {
return bestResult;
}
alpha = Math.max(alpha, bestResult.score);
}
return bestResult;
}
private SearchResult getMinValue(Board board, boolean asHuman, int recursionLevel,
int alpha, int beta) {
if (recursionLevel < 1) {
return new SearchResult(Move.NONE,scorer.getScore(board));
}
List<Move> validMoves = validMoveGenerator.genMoves(board, asHuman,
MoveGenerator.ALL_MOVES);
SearchResult bestResult = new SearchResult(Move.NONE,Integer.MAX_VALUE);
if (validMoves.size() == 0) {
return bestResult;
}
for (Move nextMove : validMoves) {
Board nextBoard = new Board(board);
if (!nextBoard.playTile(nextMove.getCell(), nextMove.getColor())) {
throw new RuntimeException(
"Illegal move attempted during search!");
}
SearchResult searchResult = new SearchResult(nextMove,getMaxValue(nextBoard, !asHuman, recursionLevel - 1,
alpha, beta).score);
if (searchResult.compareTo(bestResult) < 0) {
bestResult = searchResult;
}
if (bestResult.score <= alpha) {
return bestResult;
}
beta = Math.min(beta, bestResult.score);
}
return bestResult;
}
/**
* AlphaBetaMoveGenerator2 does not support this method.
@@ -119,4 +39,84 @@ public class AlphaBetaMoveGenerator implements MoveGenerator {
LOGGER.info("Minimax genMoves() stub returning []");
return Arrays.asList(doNothing);
}
private SearchResult getMaxValue(Board board, boolean asHuman,
int recursionLevel, int alpha, int beta) {
if (recursionLevel < 1) {
return new SearchResult(Move.NONE, scorer.getScore(board));
}
List<Move> validMoves = validMoveGenerator.genMoves(board, asHuman,
MoveGenerator.ALL_MOVES);
SearchResult bestResult = new SearchResult(Move.NONE, Integer.MIN_VALUE);
if (validMoves.size() == 0) {
return bestResult;
}
for (Move nextMove : validMoves) {
Board nextBoard = new Board(board);
if (!nextBoard.playTile(nextMove.getCell(), nextMove.getColor())) {
throw new RuntimeException(
"Illegal move attempted during search!");
}
SearchResult searchResult = new SearchResult(nextMove, getMinValue(
nextBoard, !asHuman, recursionLevel - 1, alpha, beta).score);
if (searchResult.compareTo(bestResult) > 0) {
bestResult = searchResult;
}
if (bestResult.score >= beta) {
return bestResult;
}
alpha = Math.max(alpha, bestResult.score);
}
return bestResult;
}
private SearchResult getMinValue(Board board, boolean asHuman,
int recursionLevel, int alpha, int beta) {
if (recursionLevel < 1) {
return new SearchResult(Move.NONE, scorer.getScore(board));
}
List<Move> validMoves = validMoveGenerator.genMoves(board, asHuman,
MoveGenerator.ALL_MOVES);
SearchResult bestResult = new SearchResult(Move.NONE, Integer.MAX_VALUE);
if (validMoves.size() == 0) {
return bestResult;
}
for (Move nextMove : validMoves) {
Board nextBoard = new Board(board);
if (!nextBoard.playTile(nextMove.getCell(), nextMove.getColor())) {
throw new RuntimeException(
"Illegal move attempted during search!");
}
SearchResult searchResult = new SearchResult(nextMove, getMaxValue(
nextBoard, !asHuman, recursionLevel - 1, alpha, beta).score);
if (searchResult.compareTo(bestResult) < 0) {
bestResult = searchResult;
}
if (bestResult.score <= alpha) {
return bestResult;
}
beta = Math.min(beta, bestResult.score);
}
return bestResult;
}
}