-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPoint_score.java
232 lines (208 loc) · 3.54 KB
/
Point_score.java
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
public class Point_score {
int result = 0;
public int score_point(char[][] board, int x, int y, char c){
int count = 1;
int block = 0;
int empty = -1;
// check the rows
for(int i = y+1;; i++ ) {
if(i>=8) {
block++;
break;
}
if(board[x][i]=='-') {
if(empty ==-1 && i < 7 && board[x][i+1] == c){
empty = count;
continue;
}
else break;
}
if(board[x][i]==c) {
count++;
continue;
}
else {
block++;
break;
}
}
for(int i = y-1;; i-- ) {
if(i<0) {
block++;
break;
}
if(board[x][i]=='-') {
if(empty ==-1 && i > 0 && board[x][i-1] == c){
empty = 0;
continue;
}
else break;
}
if(board[x][i]==c) {
count++;
if(empty != -1) {
empty ++;
}
continue;
}
else {
block++;
break;
}
}
result = result + calculateScore(empty, count, block);
count = 1;
block = 0;
empty = -1;
// check the columns
for(int i = x+1;; i++ ) {
if(i>=8) {
block++;
break;
}
if(board[i][y]=='-') {
if(empty ==-1 && i < 7 && board[i+1][y] == c){
empty = count;
continue;
}
else break;
}
if(board[i][y]==c) {
count++;
continue;
}
else {
block++;
break;
}
}
for(int i = x-1;; i-- ) {
if(i<0) {
block++;
break;
}
if(board[i][y]=='-') {
if(empty ==-1 && i > 0 && board[i-1][y] == c){
empty = 0;
continue;
}
else break;
}
if(board[i][y]==c) {
count++;
if(empty != -1) {
empty ++;
}
continue;
}
else {
block++;
break;
}
}
result = result + calculateScore(empty, count, block);
return result;
}
public int calculateScore(int empty, int count, int block) {
if(empty <= 0) {
if(count >= 4) return 1000;
if(block == 0) {
switch(count) {
case 1: return 10;
case 2: return 100;
case 3: return 1000;
}
}
if(block == 1) {
switch(count) {
case 1: return 5;
case 2: return 50;
case 3: return 500;
}
}
if(block == 2) {
switch(count) {
case 1: return 2;
case 2: return 25;
case 3: return 250;
}
}
}
// case X_X
else if(empty == 1) {
if(count >= 5) return 1000;
if(block == 0) {
switch(count) {
case 2: return 20;
case 3: return 110;
case 4: return 1000;
}
}
if(block == 1) {
switch(count) {
case 2: return 15;
case 3: return 105;
case 4: return 505;
}
}
if(block == 2) {
switch(count) {
case 2: return 12;
case 3: return 102;
case 4: return 502;
}
}
}
// case XX_X
else if(empty == 2) {
if(count >= 6) return 1000;
if(block == 0) {
switch(count) {
case 3: return 110;
case 4: return 200;
case 5: return 1000;
}
}
if(block == 1) {
switch(count) {
case 3: return 105;
case 4: return 150;
case 5: return 510;
}
}
if(block == 2) {
switch(count) {
case 3: return 102;
case 4: return 125;
case 5: return 505;
}
}
}
// case XXX_X
else if(empty == 3) {
if(count >= 7) return 1000;
if(block == 0) {
switch(count) {
case 4: return 1000;
case 5: return 1000;
case 6: return 1000;
}
}
if(block == 1) {
switch(count) {
case 4: return 505;
case 5: return 510;
case 6: return 115;
}
}
if(block == 2) {
switch(count) {
case 4: return 502;
case 5: return 505;
case 6: return 1000;
}
}
}
return 0;
}
}