Package nl.zoidberg.calculon.engine

Examples of nl.zoidberg.calculon.engine.MoveGenerator

37
38
39
40
41
42
43
44
45
46
    @Test
  public void threeRepeatDrawDetect1() {
    BitBoard bitBoard = new BitBoard().initialise();
   
    PGNUtils.applyMoves(bitBoard, new String[] { "Nf3", "Nf6", "Ng1", "Ng8", "Nf3", "Nf6", "Ng1", });
    assertEquals(22, new MoveGenerator(bitBoard).getAllRemainingMoves().size());
   
    PGNUtils.applyMove(bitBoard, "Ng8");
    assertEquals(0, new MoveGenerator(bitBoard).getAllRemainingMoves().size());
  }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
  }
 
    @Test
  public void knightMoves() {
    BitBoard board = FENUtils.getBoard("7k/8/8/8/8/8/7P/7K w - - 0 1");
    int baseMoves = new MoveGenerator(board).getAllRemainingMoves().size();
   
    board = FENUtils.getBoard("7k/8/8/8/3N4/8/7P/7K w - - 0 1");
    assertEquals(baseMoves + 8, new MoveGenerator(board).getAllRemainingMoves().size());

    board = FENUtils.getBoard("7k/8/8/8/8/8/7P/N6K w - - 0 1");
    assertEquals(baseMoves + 2, new MoveGenerator(board).getAllRemainingMoves().size());
  }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
    }
  }

  private int generateToDepth(int depth, BitBoard bitBoard) {
    if(depth == 1) {
            return new MoveGenerator(bitBoard).getAllRemainingMoves().size();
    }

        int count = 0;
    for(Iterator<BitBoardMove> moveItr = new MoveGenerator(bitBoard); moveItr.hasNext(); ) {
      BitBoardMove move = moveItr.next();
      byte x = bitBoard.getFlags();
      long cs = bitBoard.getChecksum();
      bitBoard.makeMove(move);
      count += generateToDepth(depth-1, bitBoard);
      bitBoard.unmakeMove();
View Full Code Here
83
84
85
86
87
88
89
    assertEquals(board.getResult(), Game.RES_NO_RESULT);
   
    // Only sacrificing the bishop for the pawn draws
    assertEquals("Bxh7", PGNUtils.translateMove(board, new ChessEngine().getPreferredMove(board)));
    PGNUtils.applyMove(board, "Bxh7");
    assertEquals(0, new MoveGenerator(board).getAllRemainingMoves().size());
  }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
      applyMove(bitBoard, s);
    }
  }
 
  public static Map<String, String> toPgnMoveMap(BitBoard bitBoard) {
    List<BitBoardMove> allMoves = new MoveGenerator(bitBoard).getAllRemainingMoves();
    Map<String, String> rv = new HashMap<String, String>();
   
    for(BitBoardMove intMove: allMoves) {
      rv.put(translateMove(bitBoard, intMove.getAlgebraic()), intMove.getAlgebraic());
    }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
      break;
    }

    if (testClash) {
      String fromSquare = simpleAlgebraic.substring(0, 2);
      List<BitBoardMove> m = new MoveGenerator(bitBoard).getAllRemainingMoves();
      List<String> clashingPieces = new ArrayList<String>();
      for (BitBoardMove key : m) {
        if (key.getAlgebraic().startsWith("O-")) {
          continue;
        }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
        System.out.println(", status = " + (rc.count == 115196793 ? "OK" : "Error! " + rc.count));
  }

  private static void generateToDepth(int depth, BitBoard board, RunningCount runningCount) {
    if(depth == 1) {
      List<BitBoardMove> allMoves = new MoveGenerator(board).getAllRemainingMoves();
      runningCount.count += allMoves.size();
      return;
    }
    for(BitBoardMove move: new MoveGenerator(board).getAllRemainingMoves()) {
      board.makeMove(move);
      generateToDepth(depth-1, board, runningCount);
      board.unmakeMove();
    }
  }
View Full Code Here
513
514
515
516
517
518
519
520
521
522
523
        send(bookMove);
        log.fine("Using book move: " + bookMove);
        return;
      }
     
      if( ! new MoveGenerator(currentBoard).hasNext()) {
        log.fine("Looks like that game is over!");
        return;
      }
     
      Runnable moveMaker = new Runnable() {
View Full Code Here
10
11
12
13
14
15
16
17
18
19
20
21
        BitBoard board = new BitBoard().initialise();

        // Min 1350
        long pre = System.nanoTime();
        for(int x = 0; x < 1000000; x++) {
            MoveGenerator moveGenerator = new MoveGenerator(board);
            moveGenerator.setGenerators(new PawnMoveGenerator());
            moveGenerator.getAllRemainingMoves();
        }
        pre = System.nanoTime() - pre;
        System.out.println("time(ms): " + pre/1000000);
    }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
     
      if(depth >= 0) {
        return alpha;
      }
  
      for(BitBoardMove move: new MoveGenerator(bitBoard).getThreateningMoves()) {
        System.out.println("Q:" + move.getAlgebraic());
        bitBoard.makeMove(move);
          int score = -quiesce(bitBoard, -beta, -alpha, depth++);
        bitBoard.unmakeMove();
  
View Full Code Here
TOP

Related Classes of nl.zoidberg.calculon.engine.MoveGenerator

  • nl.zoidberg.calculon.analyzer.GameScorer
  • nl.zoidberg.calculon.analyzer.SanityTest
  • nl.zoidberg.calculon.analyzer.SpeedTest
  • nl.zoidberg.calculon.icc.ICCInterface$BoardListener
  • nl.zoidberg.calculon.model.BoardTest
  • nl.zoidberg.calculon.model.PerftTest
  • nl.zoidberg.calculon.notation.PGNUtils
  • nl.zoidberg.calculon.util.PerformanceTests
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.