Package minesweeper.ai.games.BoardConfiguration

Examples of minesweeper.ai.games.BoardConfiguration.Position

136
137
138
139
140
141
142
143
144
145
146
      toFlag.retainAll(outFlag.asSet());
      incrementAll(toPickMap,outPick);
      incrementAll(toFlagMap,outFlag);
      return true;
    }
    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;
View Full Code Here
204
205
206
207
208
209
210
211
212
                toFlag.retainAll(flagLocs.asSet());
            }
          }
            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
19
20
21
22
23
24
25
26
27
28
29
      Node curr=Node.this;
      public boolean hasNext() {
        return curr.data != null;
      }
      public Position next() {
        Position ans = curr.data;
        curr = curr.next;
        return ans;
      }
     
    };
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
  private List<List<Position>> partition(List<Position> input) {
    List<Position> data = new ArrayList<Position>(input);
    List<List<Position>> output = new ArrayList<List<Position>>();

    while (data.size() > 0) {
      Position first = data.get(0);
      List<Position> toadd = new ArrayList<Position>();
      output.add(toadd);

      Iterator<Position> it = data.iterator();

      while (it.hasNext()) {
        Position current = it.next();
        if (isAdjacent(first, current)) {
          it.remove();
          toadd.add(current);
        }
      }
View Full Code Here
104
105
106
107
108
109
110
111
112
                toFlag.retainAll(flagLocs.asSet());
            }
          }
            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
80
81
82
83
84
85
86
87
88
89
90
    if(positions.isEmpty()) {
      toPick.retainAll(outPick.asSet());
      toFlag.retainAll(outFlag.asSet());
      return true;
    }
    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;
View Full Code Here
148
149
150
151
152
153
154
155
156
                toFlag.retainAll(flagLocs.asSet());
            }
          }
            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
42
43
44
45
46
47
48
49
50
51
52
      toFlagSet.retainAll(outFlag.asSet());
      incrementAll(toPick,outPick);
      incrementAll(toFlag,outFlag);
      return true;
    }
    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;
View Full Code Here
TOP

Related Classes of minesweeper.ai.games.BoardConfiguration.Position

  • minesweeper.ai.games.BoardInfoHelper
  • minesweeper.ai.players.BruteForceAI
  • minesweeper.ai.players.ProbablisticSearchTreeAI
  • minesweeper.ai.players.SearchTreeAI
  • minesweeper.ai.TestablePlayer
  • minesweeper.ai.utils.Node
    • 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.