Package minesweeper.ai.games

Examples of minesweeper.ai.games.BoardInfoHelper

62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        toPick.add(unknown.get((int) (unknown.size() * Math.random())));
      return toPick.size() == 1;
  }
 
  private boolean deduce(MutableBoard board) {
    BoardInfoHelper helper = new BoardInfoHelper(board);
    toPick.clear(); toFlag.clear();
    for(Position cell : helper.getCellsWithAdjacentBombs()) {
            List<Position> unknown = helper.getAdjacentCellsByValue(cell, Cell.UNKNOWN);
            List<Position> flagged = helper.getAdjacentCellsByValue(cell, Cell.FLAG);
            if(board.getCell(cell) == unknown.size() + flagged.size())
                for(Position p : unknown)
                    toFlag.add(p);
            if(board.getCell(cell) == flagged.size())
                for(Position p : unknown)
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
        }
    return toPick.size() > 0 || toFlag.size() > 0;
  }
 
    private boolean bruteForceSearch(MutableBoard board) {
      BoardInfoHelper helper = new BoardInfoHelper(board);
        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);
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
  private Set<Position> toPick;
  private Set<Position> toFlag;

  @Override
  public void solve(GameState game) {
    BoardInfoHelper helper = new BoardInfoHelper(game);
    game.pick(game.getRows()/2, game.getCols()/2);
    while(game.getState() == State.IN_PROGRESS) {
          if(! deduce(helper.getBoard()))
            if(! backtrackSolve(helper.getBoard()))
              if(! bruteForceSearch(helper.getBoard()))
                if(! pickRandom(helper.getBoard()))
                  break;
          pickAndFlag(game);
    }
   
    if(debug == DebugMode.ON) {
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
      for(Position p : toFlag)
        game.flag(p);
  }
 
  public boolean backtrackSolve(MutableBoard grid) {
    BoardInfoHelper helper = new BoardInfoHelper(grid);
      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));
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
108
109
110
    return result;
  }
 
  private boolean pickRandom(MutableBoard board) {
    toPick.clear(); toFlag.clear();
    BoardInfoHelper helper = new BoardInfoHelper(board);
      List<Position> unknown = helper.getUnknownBorderCells();
      if(unknown.size() == 0)
        unknown = helper.getCellsByValue(Cell.UNKNOWN);
      if(unknown.size() >= 1)
        toPick.add(unknown.get((int) (unknown.size() * Math.random())));
      dt = DeductionType.RANDOM;
      return toPick.size() == 1;
  }
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
      dt = DeductionType.RANDOM;
      return toPick.size() == 1;
  }
 
  private boolean deduce(MutableBoard board) {
    BoardInfoHelper helper = new BoardInfoHelper(board);
    toPick.clear(); toFlag.clear();
    for(Position cell : helper.getCellsWithAdjacentBombs()) {
            List<Position> unknown = helper.getAdjacentCellsByValue(cell, Cell.UNKNOWN);
            List<Position> flagged = helper.getAdjacentCellsByValue(cell, Cell.FLAG);
            if(board.getCell(cell) == unknown.size() + flagged.size())
                for(Position p : unknown)
                    toFlag.add(p);
            if(board.getCell(cell) == flagged.size())
                for(Position p : unknown)
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
    dt = DeductionType.NORMAL;
    return toPick.size() > 0 || toFlag.size() > 0;
  }
 
    private boolean bruteForceSearch(MutableBoard board) {
      BoardInfoHelper helper = new BoardInfoHelper(board);
        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);
View Full Code Here
13
14
15
16
17
18
19
20
21
22
23
24
import minesweeper.ai.utils.Node;

public class TestablePlayer {
 
  public void backtrackSolve(MutableBoard grid) {
    BoardInfoHelper helper = new BoardInfoHelper(grid);
      List<Position> positions = helper.getUnknownBorderCells();
      toPick = new HashMap<>(); toFlag = new HashMap<>();
      toPickSet = new HashSet<>(positions); toFlagSet = new HashSet<>(positions);
      backtrackSolve(grid, helper, positions, new Node(null,null), new Node(null,null));
      System.out.println("To Pick " + toPickSet);
      System.out.println("To Flag " + toFlagSet);
View Full Code Here
TOP

Related Classes of minesweeper.ai.games.BoardInfoHelper

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