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
|
/*
GNUGO - the game of Go (Wei-Chi)
Version 1.2 last revised 10-31-95
Copyright (C) Free Software Foundation, Inc.
written by Man L. Li
modified by Wayne Iba
modified by Frank Pursel <fpp%minor.UUCP@dragon.com>
documented by Bob Webber
*/
/*
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation - version 2.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License in file COPYING for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Please report any bug/fix, modification, suggestion to
manli@cs.uh.edu
*/
/*----------------------------------------------------------------
findpatn.c -- Find computer move from opening moves and patterns
----------------------------------------------------------------*/
#include "gnugo.h"
extern unsigned char p[19][19]; /* go board */
extern int mymove, umove; /* computer color, opponent color */
extern int opn[9]; /* opening moves indicator */
int findpatn(int *i, /* row number of next move */
int *j, /* column number of next move */
int *val) /* value of next move */
/* find pattern to match for next move */
{
int m, n;
int ti, tj, tval;
static int cnd, mtype; /* game tree node number, move type */
/* mtype = 0, basic; 1, inverted; 2, reflected; 3, inverted & reflected */
/* open game then occupy corners */
if (opn[4]) /* continue last move */
{
opn[4] = 0; /* clear flag */
if (opening(i, j, &cnd, mtype)) opn[4] = 1; /* more move then reset flag */
if (p[*i][*j] == EMPTY) /* valid move */
{
*val = 80;
return 1;
}
else
opn[4] = 0;
}
if (opn[0]) /* Northwest corner */
{
opn[0] = 0; /* clear flag */
if (openregion(0, 0, 5, 5))
{
cnd = 0;
mtype = 0;
opening(i, j, &cnd, mtype); /* get new node for next move */
if (opening(i, j, &cnd, mtype)) opn[4] = 1;
*val = 80;
return 1;
}
}
if (opn[1]) /* Southwest corner */
{
opn[1] = 0;
if (openregion(13, 0, 18, 5))
{
cnd = 0;
mtype = 1;
opening(i, j, &cnd, mtype); /* get new node for next move */
if (opening(i, j, &cnd, mtype)) opn[4] = 1;
*val = 80;
return 1;
}
}
if (opn[2]) /* Northeast corner */
{
opn[2] = 0;
if (openregion(0, 13, 5, 18))
{
cnd = 0;
mtype = 2;
opening(i, j, &cnd, mtype); /* get new node for next move */
if (opening(i, j, &cnd, mtype)) opn[4] = 1;
*val = 80;
return 1;
}
}
if (opn[3]) /* Northeast corner */
{
opn[3] = 0;
if (openregion(13, 13, 18, 18))
{
cnd = 0;
mtype = 3;
opening(i, j, &cnd, mtype); /* get new node for next move */
if (opening(i, j, &cnd, mtype)) opn[4] = 1;
*val = 80;
return 1;
}
}
/* occupy edges */
if (opn[5]) /* North edge */
{
opn[5] = 0;
if (openregion(0, 6, 4, 11))
{
*i = 3;
*j = 9;
*val = 80;
return 1;
}
}
if (opn[6]) /* South edge */
{
opn[6] = 0;
if (openregion(18, 6, 14, 11))
{
*i = 15;
*j = 9;
*val = 80;
return 1;
}
}
if (opn[7]) /* West edge */
{
opn[7] = 0;
if (openregion(6, 0, 11, 4))
{
*i = 9;
*j = 3;
*val = 80;
return 1;
}
}
if (opn[8]) /* East edge */
{
opn[8] = 0;
if (openregion(6, 18, 11, 14))
{
*i = 9;
*j = 15;
*val = 80;
return 1;
}
}
*i = -1;
*j = -1;
*val = -1;
/* find local pattern */
for (m = 0; m < 19; m++)
for (n = 0; n < 19; n++)
if ((p[m][n] == mymove) &&
(matchpat(m, n, &ti, &tj, &tval) && (tval > *val)))
{
*val = tval;
*i = ti;
*j = tj;
}
if (*val > 0) /* pattern found */
return 1;
else /* no match found */
return 0;
} /* end findpatn */
|
