-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathrobot4.c
250 lines (235 loc) · 9.39 KB
/
robot4.c
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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
/**********************************************************************************************
Copyright (c) 2021 LazyBird
File name: robot4.c
Description: 五子棋程序的源文件之一，给出了robot4的实现（注释部分），同时robot6也需要用到
Author: Eric Jin
Date: 2021.12.31
**********************************************************************************************/
#include "wuziqi.h"
void fg4_value_map_init(){
for(int i=0;i<TYPES_TOT;i++){
switch (i){
case CHANG_LIAN: fg4_value_map[i]= 5000000;break;
case CHENG_5: fg4_value_map[i]= 5000000;break;
case HUO_4: fg4_value_map[i]= 100000;break;
case CHONG_4: fg4_value_map[i]= 10000;break;
case SI_4: fg4_value_map[i]= 0;break;
case _4_4: fg4_value_map[i]= 20000;break;
case HUO_3: fg4_value_map[i]= 8000;break;
case TIAO_HUO_3: fg4_value_map[i]= 7000;break;
case MIAN_3: fg4_value_map[i]= 500;break;
case HUO_2: fg4_value_map[i]= 50;break;
case MIAN_2: fg4_value_map[i]= 10;break;
default: fg4_value_map[i]= 0;break;
}
}
}
/* inline int fg4_value_map(int pattern){
* switch (pattern){
* case CHANG_LIAN: return 5000000;break;
* case CHENG_5: return 5000000;break;
* case HUO_4: return 100000;break;
* case CHONG_4: return 10000;break;
* case SI_4: return 0;break;
* //case _3_4:
* case _4_4: return 20000;break;
* case HUO_3: return 8000;break;
* case TIAO_HUO_3: return 7000;break;
* case MIAN_3: return 500;break;
* case HUO_2: return 50;break;
* case MIAN_2: return 10;break;
* default: return 0;break;
* }
* }
*/
/* int fg4_calc_value(int x0,int y0,bool color,int dir_4){
*
* int rem=board[x0][y0];
* board[x0][y0]=color;
* //if(ban_black) lianzhu_refresh_ban_at_dir_near(x0,y0,dir_4);
*
* int score=fg4_value_map[lianzhu_calc(x0,y0,color,dir_4,ban_black)];
* // switch (lianzhu_calc(x0,y0,color,dir_4,ban_black)){
* // case CHANG_LIAN: score= 5000000;break;
* // case CHENG_5: score= 5000000;break;
* // case HUO_4: score= 100000;break;
* // case CHONG_4: score= 10000;break;
* // case SI_4: score= 0;break;
* // //case _3_4:
* // case _4_4: score= 20000;break;
* // case HUO_3: score= 8000;break;
* // case TIAO_HUO_3: score= 7000;break;
* // case MIAN_3: score= 500;break;
* // case HUO_2: score= 50;break;
* // case MIAN_2: score= 10;break;
* // default: score= 0;break;
* // }
*
* board[x0][y0]=rem;
* //if(ban_black) lianzhu_refresh_ban_at_dir_near(x0,y0,dir_4);
*
* return score;
* }
*/
void fg4_refresh_value(int (*value)[16][11],int x0,int y0){
//if(ban_black) lianzhu_refresh_ban_near(x0,y0);
//Update: 211217
//如果下边lianzhu_calc_map第二维度使用false，即不考虑禁手
//则刷新禁手可以和刷新赋值同步进行
//DONE: 211127
//注：211112的那版程序这里有问题，这句是必须的。
//原因在于robot5调用robot4时，若每层落子点附近的禁手点不刷新，其效果会累积。
//robot4自身使用时没这个问题，因为棋盘每轮稳定刷新禁手点。
for(int dir_4=1;dir_4<=4;dir_4++){
int dx=0,dy=0;
switch (dir_4){
case 1:dx=dy=1;break;
case 2:dx=1;break;
case 3:dx=1;dy=-1;break;
case 4:dy=-1;break;
default:break;
}
//int color=WHITE;
//do{
int pattern_pos_white=0;
int pattern_pos_black=0;
int x3=x0-dx*4;
int y3=y0-dy*4;
for(int i=-4;i<=4;i++,x3+=dx,y3+=dy){
pattern_pos_white<<=2;
pattern_pos_black<<=2;
if(board[x3][y3]==EDGE){
pattern_pos_white|=(WHITE^1);
pattern_pos_black|=(BLACK^1);
continue;
}
pattern_pos_white|=(board[x3][y3]&0b11);
pattern_pos_black|=(board[x3][y3]&0b11);
}
int pattern_neg_white=pattern_pos_white;
int pattern_neg_black=pattern_pos_black;
int x1=x0;
int y1=y0;
for(int k=1;k<=4;k++){
x1+=dx;
y1+=dy;
if(board[x1][y1]!=EDGE){
pattern_pos_white<<=2;
pattern_pos_black<<=2;
pattern_pos_white&=((1<<18)-1);
pattern_pos_black&=((1<<18)-1);
if(board[x1+4*dx][y1+4*dy]==EDGE){
pattern_pos_white|=(WHITE^1);
pattern_pos_black|=(BLACK^1);
}else{
pattern_pos_black|=(board[x1+4*dx][y1+4*dy]&0b11);
pattern_pos_white|=(board[x1+4*dx][y1+4*dy]&0b11);
}
if(board[x1][y1]<0){
lianzhu[x1][y1][dir_4]=lianzhu_calc_map[pattern_pos_black][false][BLACK];
board[x1][y1]=lianzhu_judge_ban(x1,y1)?BAN:EMPTY;
}
value[x1][y1][10-WHITE]-=value[x1][y1][dir_4+4*WHITE];
value[x1][y1][10-BLACK]-=value[x1][y1][dir_4+4*BLACK];
value[x1][y1][dir_4+4*WHITE]=fg4_value_map[lianzhu_calc_map[pattern_pos_white&((-1)^(0b11<<8))|(WHITE<<8)][false/*ban_black&&WHITE*/][WHITE]];
value[x1][y1][dir_4+4*BLACK]=fg4_value_map[lianzhu_calc_map[pattern_pos_black&((-1)^(0b11<<8))|(BLACK<<8)][false/*ban_black&&BLACK*/][BLACK]];
value[x1][y1][10-WHITE]+=value[x1][y1][dir_4+4*WHITE];
value[x1][y1][10-BLACK]+=value[x1][y1][dir_4+4*BLACK];
//value[x1][y1][0]=value[x1][y1][10-WHITE]+
// ((ban_black&&board[x1][y1]==BAN)?0:value[x1][y1][10-BLACK]);
value[x1][y1][0]=value[x1][y1][10-WHITE]+value[x1][y1][10-BLACK];
}else{
break;
}
}
x1=x0;
y1=y0;
for(int k=1;k<=4;k++){
x1-=dx;
y1-=dy;
if(board[x1][y1]!=EDGE){
pattern_neg_white>>=2;
pattern_neg_black>>=2;
if(board[x1-4*dx][y1-4*dy]==EDGE){
pattern_neg_white|=((WHITE^1)<<16);
pattern_neg_black|=((BLACK^1)<<16);
}else{
pattern_neg_white|=((board[x1-4*dx][y1-4*dy]&0b11)<<16);
pattern_neg_black|=((board[x1-4*dx][y1-4*dy]&0b11)<<16);
}
if(board[x1][y1]<0){
lianzhu[x1][y1][dir_4]=lianzhu_calc_map[pattern_neg_black][false][BLACK];
board[x1][y1]=lianzhu_judge_ban(x1,y1)?BAN:EMPTY;
}
value[x1][y1][10-WHITE]-=value[x1][y1][dir_4+4*WHITE];
value[x1][y1][10-BLACK]-=value[x1][y1][dir_4+4*BLACK];
value[x1][y1][dir_4+4*WHITE]=fg4_value_map[lianzhu_calc_map[pattern_neg_white&((-1)^(0b11<<8))|(WHITE<<8)][false/*ban_black&&WHITE*/][WHITE]];
value[x1][y1][dir_4+4*BLACK]=fg4_value_map[lianzhu_calc_map[pattern_neg_black&((-1)^(0b11<<8))|(BLACK<<8)][false/*ban_black&&BLACK*/][BLACK]];
value[x1][y1][10-WHITE]+=value[x1][y1][dir_4+4*WHITE];
value[x1][y1][10-BLACK]+=value[x1][y1][dir_4+4*BLACK];
//value[x1][y1][0]=value[x1][y1][10-WHITE]+
// ((ban_black&&board[x1][y1]==BAN)?0:value[x1][y1][10-BLACK]);
value[x1][y1][0]=value[x1][y1][10-WHITE]+value[x1][y1][10-BLACK];
}else{
break;
}
}
//}while(color^=1);
}
}
/* void fg4(){
* int max=-1;
* x=y=0;
* if(step!=1){
* fg4_refresh_value(fg4_value,fg4_x_self,fg4_y_self);
* //fg4_debug();
* fg4_refresh_value(fg4_value,last_x,last_y);
* //fg4_debug(fg4_value);
* if(!(step&1)){
* for(int i=1;i<=15;i++){
* for(int j=1;j<=15;j++){
* if(board[i][j]<0&&fg4_value[i][j][0]>=max){
* //if(max==fg4_value[i][j][0]&&rand()%4){
* // continue;
* //}
* x=i;
* y=j;
* max=fg4_value[i][j][0];
* }
* }
* }
* }else{
* for(int i=1;i<=15;i++){
* for(int j=1;j<=15;j++){
* if(board[i][j]==EMPTY&&fg4_value[i][j][0]>=max){
* //if(max==fg4_value[i][j][0]&&rand()%4){
* // continue;
* //}
* x=i;
* y=j;
* max=fg4_value[i][j][0];
* }
* }
* }
* }
* }else{
* x=y=8;
* }
* fg4_x_self=x;
* fg4_y_self=y;
* }
*
* void nt4(){
* memset(fg4_value,0,sizeof(fg4_value));
* lianzhu_calc_init();
* fg4_value_map_init();
* }
*
* void re4(bool is_black){
* for(int j=7-err;j>0;j--){
* int tmp_x=timeline[step+j].x;
* int tmp_y=timeline[step+j].y;
* fg4_refresh_value(fg4_value,tmp_x,tmp_y);
* }
* }
*/