final submit

Author: gkcs

src/main/java/main/java/hackerearth/taunt/Taunt.java

@@ -889,35 +889,6 @@ public int heuristicValue(final int movesPlayed,
  }
 
  public int evaluatePosition(final Board board) {
- double firstPlayerMoveScore = 0, secondPlayerMoveScore = 0;
- double firstPlayerBlockScore = 0, secondPlayerBlockScore = 0;
- double firstPlayerCaptureScore = 0, secondPlayerCaptureScore = 0;
- final Set<Cell> firstPlayerDestinations = Arrays.stream(board.moves[1])
- .filter(Objects::nonNull)
- .map(move -> move.end)
- .collect(Collectors.toSet()),
- secondPlayerDestinations = Arrays.stream(board.moves[2])
- .filter(Objects::nonNull)
- .map(move -> move.end)
- .collect(Collectors.toSet());
- for (int i = 0; i < board.options[1]; i++) {
- if (moves[1][i].isACapture()) {
- firstPlayerCaptureScore++;
- } else if (secondPlayerDestinations.contains(moves[1][i].end)) {
- firstPlayerBlockScore++;
- } else {
- firstPlayerMoveScore++;
- }
- }
- for (int i = 0; i < board.options[2]; i++) {
- if (moves[2][i].isACapture()) {
- secondPlayerCaptureScore++;
- } else if (secondPlayerDestinations.contains(moves[1][i].end)) {
- secondPlayerBlockScore++;
- } else {
- secondPlayerMoveScore++;
- }
- }
  return (board.pieceCount[1] - board.pieceCount[2]) * MinMax.PIECE_VALUE;
  }
 

src/main/java/main/java/hackerearth/taunt/TauntTest.java

@@ -206,6 +206,25 @@ public void test11() {
  Assert.assertNotEquals(new Board.Cell(7, 0), move.end);
  }
 
+ @Test
+ public void test13() {
+ final MinMax minMax = new MinMax(700, 10);
+// minMax.setTest(true);
+ final Move move = minMax.iterativeSearchForBestMove(1, constructBoard("000 000 131 121\n" +
+ "121 121 111 111\n" +
+ "000 000 000 000\n" +
+ "111 000 000 000\n" +
+ "131 220 000 131\n" +
+ "000 000 000 000\n" +
+ "210 000 000 000\n" +
+ "000 000 000 210\n" +
+ "000 210 000 220\n" +
+ "220 230 230 230"));
+ minMax.metrics();
+ System.out.println(move);
+ Assert.assertNotEquals(new Board.Cell(4, 0), move.start);
+ }
+
  private Board constructBoard(final String input) {
  final String rows[] = input.split("\n");
  final byte[][] board = new byte[Board.ROWS][Board.COLS];