Package minesweeper.ai.utils

Examples of minesweeper.ai.utils.Node

96
97
98
99
100
101
102
103
104
105
106
      for(List<Position> positions : helper.getClosedUnknownBorderCells()) {
        probBacktrackValid = false;
        toPickMap.clear(); toFlagMap.clear(); solutionsFound = 0;
        toPick.clear(); toPick.addAll(positions);
        toFlag.clear(); toFlag.addAll(positions);
        backtrackSolve(grid, helper, positions, new Node(null,null), new Node(null,null));
        if(toPick.size() == 0 && toFlag.size() == 0) {
          toPick.clear(); toFlag.clear();
          Entry<Position, Integer> pickMax = null, flagMax = null;
          if(toPickMap.size() >= 1) pickMax = Collections.max(toPickMap.entrySet(), (a,b) -> a.getValue()-b.getValue());
          if(toFlagMap.size() >= 1) flagMax = Collections.max(toFlagMap.entrySet(), (a,b) -> a.getValue()-b.getValue());
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
    }
    Position p = positions.remove(0);
    board.setCell(p,Cell.NO_BOMB);
    boolean result = false;
    if(helper.validate(p))
      if(backtrackSolve(board,helper,positions,new Node(p,outPick),outFlag))
        result = true;
    board.setCell(p, Cell.FLAG);
    if(helper.validate(p))
      if(backtrackSolve(board,helper,positions,outPick,new Node(p,outFlag)))
        result = true;
    board.setCell(p, Cell.UNKNOWN);
    positions.add(0,p);
    return result;
  }
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
        List<Position> unknown = helper.getCellsByValue(Cell.UNKNOWN);
        int bombsToPlace = board.getRemainingBombs();
        toFlag.clear(); toPick.clear();
        if(Combinations.nCr(unknown.size(), bombsToPlace) < SEARCH_SPACE_LIMIT) {
          toFlag.addAll(unknown); toPick.addAll(unknown);
          enumerateBombLocations(helper, unknown, new Node(null,null), new Node(null,null), bombsToPlace);
          dt = DeductionType.BRUTE_FORCE;
          if(debug == DebugMode.ON) System.out.println("BRUTE FORCE results: " + toPick + toFlag);
          return toPick.size() > 0 || toFlag.size() > 0;
        } else return false;
    }
View Full Code Here
205
206
207
208
209
210
211
212
            }
          }
            return;
        } else if(bombsToPlace < 0 || bombsToPlace > unknown.size()) return;
        Position p = unknown.remove(0);
        enumerateBombLocations(helper,new ArrayList<>(unknown),new Node(p,flagLocs), pickLocs, bombsToPlace-1);
        enumerateBombLocations(helper,new ArrayList<>(unknown),flagLocs, new Node(p,pickLocs), bombsToPlace);
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
        List<Position> unknown = helper.getCellsByValue(Cell.UNKNOWN);
        int bombsToPlace = board.getRemainingBombs();
        toFlag.clear(); toPick.clear();
        if(Combinations.nCr(unknown.size(), bombsToPlace) < SEARCH_SPACE_LIMIT) {
          toFlag.addAll(unknown); toPick.addAll(unknown);
          enumerateBombLocations(helper, board, unknown, new Node(null,null), new Node(null,null), bombsToPlace);
          return toPick.size() > 0 || toFlag.size() > 0;
        } else return false;

    }
View Full Code Here
105
106
107
108
109
110
111
112
            }
          }
            return;
        } else if(bombsToPlace < 0 || bombsToPlace > unknown.size()) return;
        Position p = unknown.remove(0);
        enumerateBombLocations(helper,board,new ArrayList<>(unknown),new Node(p,flagLocs), pickLocs, bombsToPlace-1);
        enumerateBombLocations(helper,board,new ArrayList<>(unknown),flagLocs, new Node(p,pickLocs), bombsToPlace);
    }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
      for(List<Position> positions : helper.getClosedUnknownBorderCells()) {
//        if(positions.size() > 15)
//          positions = positions.subList(0, 15);
        toPick.clear(); toPick.addAll(positions);
        toFlag.clear(); toPick.addAll(positions);
        backtrackSolve(grid, helper, positions, new Node(null,null), new Node(null,null));
        dt = DeductionType.BACKTRACK;
        if(toPick.size() > 0 || toFlag.size() > 0)
          return true;
      }
      return false;
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
    }
    Position p = positions.remove(0);
    board.setCell(p,Cell.NO_BOMB);
    boolean result = false;
    if(helper.validate(p))
      if(backtrackSolve(board,helper,positions,new Node(p,outPick),outFlag))
        result = true;
    board.setCell(p, Cell.FLAG);
    if(helper.validate(p))
      if(backtrackSolve(board,helper,positions,outPick,new Node(p,outFlag)))
        result = true;
    board.setCell(p, Cell.UNKNOWN);
    positions.add(0,p);
    return result;
  }
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
        List<Position> unknown = helper.getCellsByValue(Cell.UNKNOWN);
        int bombsToPlace = board.getRemainingBombs();
        toFlag.clear(); toPick.clear();
        if(Combinations.nCr(unknown.size(), bombsToPlace) < SEARCH_SPACE_LIMIT) {
          toFlag.addAll(unknown); toPick.addAll(unknown);
          enumerateBombLocations(helper, unknown, new Node(null,null), new Node(null,null), bombsToPlace);
          dt = DeductionType.BRUTE_FORCE;
          return toPick.size() > 0 || toFlag.size() > 0;
        } else return false;

    }
View Full Code Here
149
150
151
152
153
154
155
156
            }
          }
            return;
        } else if(bombsToPlace < 0 || bombsToPlace > unknown.size()) return;
        Position p = unknown.remove(0);
        enumerateBombLocations(helper,new ArrayList<>(unknown),new Node(p,flagLocs), pickLocs, bombsToPlace-1);
        enumerateBombLocations(helper,new ArrayList<>(unknown),flagLocs, new Node(p,pickLocs), bombsToPlace);
    }
View Full Code Here
TOP

Related Classes of minesweeper.ai.utils.Node

  • minesweeper.ai.games.BoardConfiguration.Position
  • minesweeper.ai.players.BruteForceAI
  • minesweeper.ai.players.ProbablisticSearchTreeAI
  • minesweeper.ai.players.SearchTreeAI
  • minesweeper.ai.TestablePlayer
    • 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.