-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reversi.c
167 lines (167 loc) · 2.84 KB
/
Reversi.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
#include<stdio.h>
#define LARGE (2100000000)
struct node
{
int d[8][8];
};
int max(int a,int b)
{
if(a>b)
return a;
else
return b;
}
int min(int a,int b)
{
if(a<b)
return a;
else
return b;
}
void read(FILE*fp,struct node*a)
{
char c;
int f1;
int f2;
for(f1=0;f1<8;f1++)
for(f2=0;f2<8;f2++)
{
do
c=fgetc(fp);
while((c!='0')&&(c!='1')&&(c!=' '));
if(c==' ')
a->d[f1][f2]=-1;
else
a->d[f1][f2]=c-'0';
}
return;
}
int check(struct node*a,struct node*b,int x,int y,int d)
{
int ret;
int f1;
int f2;
if((x<0)||(x>=8)||(y<0)||(y>=8)||(a->d[x][y]!=-1))
return 0;
ret=0;
*b=*a;
b->d[x][y]=d;
if((x>=2)&&(b->d[x-1][y]==(d^1)))
for(f1=2;(x-f1>=0)&&(b->d[x-f1][y]!=-1);f1++)
if(b->d[x-f1][y]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x-f2][y]=d;
break;
}
if((x<6)&&(b->d[x+1][y]==(d^1)))
for(f1=2;(x+f1<8)&&(b->d[x+f1][y]!=-1);f1++)
if(b->d[x+f1][y]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x+f2][y]=d;
break;
}
if((y>=2)&&(b->d[x][y-1]==(d^1)))
for(f1=2;(y-f1>=0)&&(b->d[x][y-f1]!=-1);f1++)
if(b->d[x][y-f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x][y-f2]=d;
break;
}
if((y<6)&&(b->d[x][y+1]==(d^1)))
for(f1=2;(y+f1<8)&&(b->d[x][y+f1]!=-1);f1++)
if(b->d[x][y+f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x][y+f2]=d;
break;
}
if((x>=2)&&(y>=2)&&(b->d[x-1][y-1]==(d^1)))
for(f1=2;(x-f1>=0)&&(y-f1>=0)&&(b->d[x-f1][y-f1]!=-1);f1++)
if(b->d[x-f1][y-f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x-f2][y-f2]=d;
break;
}
if((x>=2)&&(y<6)&&(b->d[x-1][y+1]==(d^1)))
for(f1=2;(x-f1>=0)&&(y+f1<8)&&(b->d[x-f1][y+f1]!=-1);f1++)
if(b->d[x-f1][y+f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x-f2][y+f2]=d;
break;
}
if((x<6)&&(y>=2)&&(b->d[x+1][y-1]==(d^1)))
for(f1=2;(x+f1<8)&&(y-f1>=0)&&(b->d[x+f1][y-f1]!=-1);f1++)
if(b->d[x+f1][y-f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x+f2][y-f2]=d;
break;
}
if((x<6)&&(y<6)&&(b->d[x+1][y+1]==(d^1)))
for(f1=2;(x+f1<8)&&(y+f1<8)&&(b->d[x+f1][y+f1]!=-1);f1++)
if(b->d[x+f1][y+f1]==d)
{
ret=1;
for(f2=1;f2<f1;f2++)
b->d[x+f2][y+f2]=d;
break;
}
return ret;
}
int maxmin(struct node*a,int d,int f)
{
struct node b;
int flag;
int ret;
int f1;
int f2;
flag=0;
if(d==0)
ret=-LARGE;
else
ret=LARGE;
for(f1=0;f1<8;f1++)
for(f2=0;f2<8;f2++)
if((a->d[f1][f2]==-1)&&check(a,&b,f1,f2,d))
{
flag=1;
if(d==0)
ret=max(ret,maxmin(&b,d^1,0));
else
ret=min(ret,maxmin(&b,d^1,0));
}
if(flag)
return ret;
if(!f)
return maxmin(a,d^1,1);
ret=0;
for(f1=0;f1<8;f1++)
for(f2=0;f2<8;f2++)
{
if(a->d[f1][f2]==0)
ret++;
if(a->d[f1][f2]==1)
ret--;
}
return ret;
}
int main()
{
struct node a;
int d;
scanf("%d",&d);
read(stdin,&a);
printf("%d\n",maxmin(&a,d,0));
}