File: pattern.cc

package info (click to toggle)
grhino 0.16.1-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster
  • size: 3,680 kB
  • sloc: cpp: 10,637; sh: 3,120; xml: 1,099; makefile: 432; perl: 337; sed: 27
file content (370 lines) | stat: -rw-r--r-- 10,649 bytes parent folder | download | duplicates (6)
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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
/*
	pattern.cc	Pattern database
	Copyright (c) 2001, 2002, 2003 Kriang Lerdsuwanakij
	email:		lerdsuwa@users.sourceforge.net

	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; either version 2 of the License, or
	(at your option) any later version.

	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 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.
*/

#include "pattern.h"
#include "order.h"
#include "gtstream.h"

#include <cstring>
#include <unistd.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <stdexcept>

#ifdef _
#undef _
#endif

#ifdef N_
#undef N_
#endif

#include <libintl.h>
#define _(x) gettext(x)
#define N_(x) (x)


// These are not correct in terms of symmetry but provide better
// opening moves

const char row1_pattern[4][8] = {
	{ A1, B1, C1, D1, E1, F1, G1, H1 },
	{ A8, B8, C8, D8, E8, F8, G8, H8 },
	{ A1, A2, A3, A4, A5, A6, A7, A8 },
	{ H1, H2, H3, H4, H5, H6, H7, H8 }
};

const char row2_pattern[4][8] = {
	{ A2, B2, C2, D2, E2, F2, G2, H2 },
	{ A7, B7, C7, D7, E7, F7, G7, H7 },
	{ B1, B2, B3, B4, B5, B6, B7, B8 },
	{ G1, G2, G3, G4, G5, G6, G7, G8 }
};

const char row3_pattern[4][8] = {
	{ A3, B3, C3, D3, E3, F3, G3, H3 },
	{ A6, B6, C6, D6, E6, F6, G6, H6 },
	{ C1, C2, C3, C4, C5, C6, C7, C8 },
	{ F1, F2, F3, F4, F5, F6, F7, F8 }
};

const char row4_pattern[4][8] = {
	{ A4, B4, C4, D4, E4, F4, G4, H4 },
	{ A5, B5, C5, D5, E5, F5, G5, H5 },
	{ D1, D2, D3, D4, D5, D6, D7, D8 },
	{ E1, E2, E3, E4, E5, E6, E7, E8 }
};

const char diag1_pattern[2][8] = {
	{ A1, B2, C3, D4, E5, F6, G7, H8 },
	{ H1, G2, F3, E4, D5, C6, B7, A8 }
};

const char diag2_pattern[4][7] = {
	{ A2, B3, C4, D5, E6, F7, G8 },
	{ B1, C2, D3, E4, F5, G6, H7 },
	{ H2, G3, F4, E5, D6, C7, B8 },
	{ G1, F2, E3, D4, C5, B6, A7 }
};

const char diag3_pattern[4][6] = {
	{ A3, B4, C5, D6, E7, F8 },
	{ C1, D2, E3, F4, G5, H6 },
	{ H3, G4, F5, E6, D7, C8 },
	{ F1, E2, D3, C4, B5, A6 }
};

const char diag4_pattern[4][5] = {
	{ A4, B5, C6, D7, E8 },
	{ D1, E2, F3, G4, H5 },
	{ H4, G5, F6, E7, D8 },
	{ E1, D2, C3, B4, A5 }
};

const char diag5_pattern[4][4] = {
	{ A5, B6, C7, D8 },
	{ E1, F2, G3, H4 },
	{ H5, G6, F7, E8 },
	{ D1, C2, B3, A4 }
};

const char edge_x_pattern[4][10] = {
	{ B2, A1, B1, C1, D1, E1, F1, G1, H1, G2 },
	{ B7, A8, B8, C8, D8, E8, F8, G8, H8, G7 },
	{ B2, A1, A2, A3, A4, A5, A6, A7, A8, B7 },
	{ G2, H1, H2, H3, H4, H5, H6, H7, H8, G7 }
};

const char corner5x2_pattern[8][10] = {
	{ A1, B1, C1, D1, E1, A2, B2, C2, D2, E2 },
	{ H1, G1, F1, E1, D1, H2, G2, F2, E2, D2 },
	{ A8, B8, C8, D8, E8, A7, B7, C7, D7, E7 },
	{ H8, G8, F8, E8, D8, H7, G7, F7, E7, D7 },
	{ A1, A2, A3, A4, A5, B1, B2, B3, B4, B5 },
	{ A8, A7, A6, A5, A4, B8, B7, B6, B5, B4 },
	{ H1, H2, H3, H4, H5, G1, H2, H3, H4, G5 },
	{ H8, H7, H6, H5, H4, G8, H7, H6, H5, G4 }
};

const pattern_data_t pattern_data[PATTERN_UNKNOWN] = {
	{ 8, true, 4, PATTERN_PATH "row1.pat", PATTERN_PATH "row1.bin",
	  { row1_pattern[0], row1_pattern[1],
	    row1_pattern[2], row1_pattern[3], 0, 0, 0, 0 } },
	{ 8, true, 4, PATTERN_PATH "row2.pat", PATTERN_PATH "row2.bin",
	  { row2_pattern[0], row2_pattern[1],
	    row2_pattern[2], row2_pattern[3], 0, 0, 0, 0 } },
	{ 8, true, 4, PATTERN_PATH "row3.pat", PATTERN_PATH "row3.bin",
	  { row3_pattern[0], row3_pattern[1],
	    row3_pattern[2], row3_pattern[3], 0, 0, 0, 0 } },
	{ 8, true, 4, PATTERN_PATH "row4.pat", PATTERN_PATH "row4.bin",
	  { row4_pattern[0], row4_pattern[1],
	    row4_pattern[2], row4_pattern[3], 0, 0, 0, 0 } },
	{ 8, true, 2, PATTERN_PATH "diag1.pat", PATTERN_PATH "diag1.bin",
	  { diag1_pattern[0], diag1_pattern[1],
	    0, 0, 0, 0, 0, 0 } },
	{ 7, true, 4, PATTERN_PATH "diag2.pat", PATTERN_PATH "diag2.bin",
	  { diag2_pattern[0], diag2_pattern[1],
	    diag2_pattern[2], diag2_pattern[3], 0, 0, 0, 0 } },
	{ 6, true, 4, PATTERN_PATH "diag3.pat", PATTERN_PATH "diag3.bin",
	  { diag3_pattern[0], diag3_pattern[1],
	    diag3_pattern[2], diag3_pattern[3], 0, 0, 0, 0 } },
	{ 5, true, 4, PATTERN_PATH "diag4.pat", PATTERN_PATH "diag4.bin",
	  { diag4_pattern[0], diag4_pattern[1],
	    diag4_pattern[2], diag4_pattern[3], 0, 0, 0, 0 } },
	{ 4, true, 4, PATTERN_PATH "diag5.pat", PATTERN_PATH "diag5.bin",
	  { diag5_pattern[0], diag5_pattern[1],
	    diag5_pattern[2], diag5_pattern[3], 0, 0, 0, 0 } },
	{ 10, true, 4, PATTERN_PATH "edge-x.pat", PATTERN_PATH "edge-x.bin",
	  { edge_x_pattern[0], edge_x_pattern[1],
	    edge_x_pattern[2], edge_x_pattern[3], 0, 0, 0, 0 } },
	{ 10, false, 8, PATTERN_PATH "corner5x2.pat", PATTERN_PATH "corner5x2.bin",
	  { corner5x2_pattern[0], corner5x2_pattern[1],
	    corner5x2_pattern[2], corner5x2_pattern[3],
	    corner5x2_pattern[4], corner5x2_pattern[5],
	    corner5x2_pattern[6], corner5x2_pattern[7] } }
};

pattern_info	*pattern_table[PATTERN_UNKNOWN][num_move_index];

// File used by gen_pattern
const char *get_pattern_file_public(pattern_t p)
{
	return pattern_data[p].pattern_file;
}

// File used by gen_pattern
const char *get_pattern_file_private(pattern_t p)
{
	const char * s = get_pattern_file_public(p);
	const char * l = strrchr(s, '/');
	if (l)
		s = l+1;
	return s;
}

// File containing condensed information for GRhino
const char *get_pattern_data_file_public(pattern_t p)
{
	return pattern_data[p].data_file;
}

// File containing condensed information for GRhino
const char *get_pattern_data_file_private(pattern_t p)
{
	const char * s = get_pattern_data_file_public(p);
	const char * l = strrchr(s, '/');
	if (l)
		s = l+1;
	return s;
}

const char *get_pattern_file(pattern_t p)
{
	if (get_use_private_files())
		return get_pattern_file_private(p);
	else
		return get_pattern_file_public(p);
}

const char *get_pattern_data_file(pattern_t p)
{
	if (get_use_private_files())
		return get_pattern_data_file_private(p);
	else
		return get_pattern_data_file_public(p);
}

void	pattern_table_init(pattern_t p)
{
	int size = pow_3[get_pattern_piece(p)];
	int comp_size = size/3*2;

	int handle = open(get_pattern_data_file(p), O_RDONLY);
	if (handle == -1) {
		gtstream bufstr;
		gtout(bufstr, _("cannot open file %$\n"))
			<< get_pattern_data_file(p);
		throw std::runtime_error(bufstr.str());
	}
	for (int i = 0; i < num_move_index; ++i) {
		pattern_table[p][i] = new pattern_info[size];
		if (read(handle, pattern_table[p][i], comp_size) != comp_size) {
			close(handle);

			gtstream bufstr;
			gtout(bufstr, _("cannot read file %$\n"))
				<< get_pattern_data_file(p);
			throw std::runtime_error(bufstr.str());
		}
		for (int j = comp_size, k = size/3-1; j < size; ++j, --k)
			pattern_table[p][i][j] = -pattern_table[p][i][k];
	}
	close(handle);
}

void	pattern_table_init()
{
	pattern_table_init(PATTERN_ROW1);
	pattern_table_init(PATTERN_ROW2);
	pattern_table_init(PATTERN_ROW3);
	pattern_table_init(PATTERN_ROW4);
	pattern_table_init(PATTERN_DIAG1);
	pattern_table_init(PATTERN_DIAG2);
	pattern_table_init(PATTERN_DIAG3);
	pattern_table_init(PATTERN_DIAG4);
	pattern_table_init(PATTERN_DIAG5);
	pattern_table_init(PATTERN_CORNER5X2);
}

inline int	pattern_eval(byte_board_info *board, int pos, pattern_t p)
{
	int	score = 0;
	for (int i = 0; i < pattern_data[p].num_pattern; ++i) {
		int pos1 = 0;
		for (int j = 0; j < pattern_data[p].piece; ++j) {
			pos1 += pow_3[j] * to_pattern_index(board->board[
						static_cast<int>(pattern_data[p].pattern[i][j])]);
		}
		score += pattern_table[p][pos][pos1];
	}
	return score;
}

int	pattern_eval(byte_board_info *board, pattern_t p, int index)
{
	if (board->get_num_move() == 0)
		return 0;		// Beginning of the game

	int pos = to_move_index(board->get_num_move());
	int pos1 = 0;
	for (int j = 0; j < pattern_data[p].piece; ++j) {
		pos1 += pow_3[j] * to_pattern_index(board->board[
						static_cast<int>(pattern_data[p].pattern[index][j])]);
	}
	return pattern_table[p][pos][pos1];
}

int	pattern_eval(byte_board_info *board)
{
	if (board->get_num_move() == 0)
		return 0;		// Beginning of the game

	int score = 0;
	int pos = to_move_index(board->get_num_move());
	score += pattern_eval(board, pos, PATTERN_ROW1);
	score += pattern_eval(board, pos, PATTERN_ROW2);
	score += pattern_eval(board, pos, PATTERN_ROW3);
	score += pattern_eval(board, pos, PATTERN_ROW4);
	score += pattern_eval(board, pos, PATTERN_DIAG1);
	score += pattern_eval(board, pos, PATTERN_DIAG2);
	score += pattern_eval(board, pos, PATTERN_DIAG3);
	score += pattern_eval(board, pos, PATTERN_DIAG4);
	score += pattern_eval(board, pos, PATTERN_DIAG5);
	score += pattern_eval(board, pos, PATTERN_CORNER5X2);
	return score;
}

inline void	pattern_eval_debug(byte_board_info *board, int pos, pattern_t p)
{
	int	score = 0;
	std::cout << "                Pat" << int(p) << ' ';
	for (int i = 0; i < pattern_data[p].num_pattern; ++i) {
		int pos1 = 0;
		for (int j = 0; j < pattern_data[p].piece; ++j) {
			switch(board->board[static_cast<int>(pattern_data[p].pattern[i][j])]) {
				case BLACK:
					std::cout << "X ";
					break;
				case WHITE:
					std::cout << "O ";
					break;
				case EMPTY:
					std::cout << ". ";
					break;
			}
			pos1 += pow_3[j] * to_pattern_index(board->board[
						static_cast<int>(pattern_data[p].pattern[i][j])]);
		}
		std::cout << "-> " << int(pattern_table[p][pos][pos1]) << '\n';
		score += pattern_table[p][pos][pos1];
	}
}

void	pattern_eval_debug(byte_board_info *board)
{
	int pos = to_move_index(board->get_num_move());
	pattern_eval_debug(board, pos, PATTERN_ROW1);
	pattern_eval_debug(board, pos, PATTERN_ROW2);
	pattern_eval_debug(board, pos, PATTERN_ROW3);
	pattern_eval_debug(board, pos, PATTERN_ROW4);
	pattern_eval_debug(board, pos, PATTERN_DIAG1);
	pattern_eval_debug(board, pos, PATTERN_DIAG2);
	pattern_eval_debug(board, pos, PATTERN_DIAG3);
	pattern_eval_debug(board, pos, PATTERN_DIAG4);
	pattern_eval_debug(board, pos, PATTERN_DIAG5);
	pattern_eval_debug(board, pos, PATTERN_CORNER5X2);
}

void	show_pattern(pattern_t p, int i)
{
	std::cout << " ";
	for (int j = 0; j < get_pattern_piece(p); ++j) {
		switch (to_board_index(i % 3)) {
			case WHITE:
				std::cout << "O ";
				break;
			case BLACK:
				std::cout << "X ";
				break;
			case EMPTY:
				std::cout << ". ";
				break;
		}
		i /= 3;
	}
}

// pos = 1 .. 60
int	to_move_index(int pos)
{
	return (pos - 1)/4;
}