-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinesweeperAI.java
More file actions
171 lines (170 loc) · 4.28 KB
/
MinesweeperAI.java
File metadata and controls
171 lines (170 loc) · 4.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
import java.awt.Point;
import java.util.Random;
class MinesweeperAI{
Cell[][] cellArray;
NewController controller;
Point point;
int[] arrH;
int[] arrV;
boolean revealable = false;
boolean needMoreGuessing = true, flag = false, reveal = false, endLoop = false;
Random a = new Random();
public MinesweeperAI(NewController control){
controller = control;
arrH = controller.getHArr();
arrV = controller.getVArr();
}
public void findNextMove(){
cellArray = controller.getArray();
endLoop = false;
if(!revealedEnoughOfBoard()){
needMoreGuessing = true;
}
if(needMoreGuessing){
System.out.println("Guessing");
while(true){
int x = a.nextInt(cellArray.length);
int y = a.nextInt(cellArray.length);
if(cellArray[x][y].myRevealed != true && !cellArray[x][y].myFlagged){
// possibleMoves[x][y] = true;
controller.revealCell(x,y);
if(revealedEnoughOfBoard()){
flag = true;
needMoreGuessing = false;
}
if(cellArray[x][y].myhasMine == true){
controller.endGame();
}
break;
}
}
} else if(flag){
System.out.println("Flagging");
int i = 0;
int j = 0;
while(!endLoop){
int unrevealed = numUnrevealedCells(i,j);
if(unrevealed == cellArray[i][j].myNum){
Point[] arr = findUnrevealed(unrevealed, i,j);
for(int c = 0; c < arr.length; c++){
int row = (int)(arr[c].getX());
int col = (int)(arr[c].getY());
if(!cellArray[row][col].myFlagged){
controller.flag(row,col);
cellArray[row][col].myFlagged = true;
}
}
}
if(j == cellArray.length-1){
j = 0;
i++;
if(i == cellArray.length) endLoop = true;
} else {
j++;
}
}
flag = false;
reveal = true;
} else if(reveal){
System.out.println("On Reveal");
for(int i = 0; i < cellArray.length; i++){
for(int j = 0; j < cellArray.length; j++){
if(cellArray[i][j].myNum == neighborsFlagged(i,j)){
revealAllUnflaggedNeighbors(i,j);
}
}
}
if(!revealable){
System.out.println("NOT Revealable");
needMoreGuessing = true;
revealable = false;
}
flag = true;
// needMoreGuessing = true;
}
}
public boolean revealedEnoughOfBoard(){
int a = 0;
for(int i = 0; i < cellArray.length; i++){
for(int j = 0; j < cellArray.length; j++){
if(cellArray[i][j].myRevealed == true){
a++;
}
}
}
if(a/cellArray.length >= 0.10) return true;
return false;
}
public int numUnrevealedCells(int row, int col){
int currRow = row, currCol = col, numUnrevealed = 0;
for(int i = 0; i < arrV.length; i++){
currRow += arrV[i];
currCol += arrH[i];
if(inBounds(currRow,currCol)){
if(!cellArray[currRow][currCol].myRevealed){
numUnrevealed++;
}
}
currRow = row;
currCol = col;
}
return numUnrevealed;
}
public int neighborsFlagged(int row, int col){
int currRow = row, currCol = col, numFlagged = 0;
for(int i = 0; i < arrV.length; i++){
currRow += arrV[i];
currCol += arrH[i];
if(inBounds(currRow,currCol)){
if(cellArray[currRow][currCol].myFlagged){
numFlagged++;
}
}
currRow = row;
currCol = col;
}
return numFlagged;
}
public void revealAllUnflaggedNeighbors(int row, int col){
int currRow = row, currCol = col;
for(int i = 0; i < arrV.length; i++){
currRow += arrV[i];
currCol += arrH[i];
if(inBounds(currRow,currCol)){
if(!cellArray[currRow][currCol].myFlagged && !cellArray[currRow][currCol].myRevealed){
controller.revealCell(currRow,currCol);
cellArray[currRow][currCol].myRevealed = true;
System.out.println("Revealed: " + currRow + "," + currCol);
revealable = true;
}
}
currRow = row;
currCol = col;
}
}
public Point[] findUnrevealed(int unrevealed, int row, int col){
int a = 0;
Point[] arr = new Point[unrevealed];
int currRow = row, currCol = col;
for(int i = 0; i < arrV.length; i++){
currRow += arrV[i];
currCol += arrH[i];
if(inBounds(currRow,currCol)){
if(!cellArray[currRow][currCol].myRevealed){
Point point = new Point(currRow,currCol);
arr[a] = point;
a++;
}
}
currRow = row;
currCol = col;
}
return arr;
}
public boolean inBounds(int row, int col){
if(row >= 0 && row < cellArray.length && col >= 0 && col < cellArray.length){
return true;
}
return false;
}
}