4 * ----------------------------------------------------------------------
5 * Copyright (c) 1993, 1994, 1995 Matthias Mutz
6 * Copyright (c) 1999 Michael Vanier and the Free Software Foundation
8 * GNU SHOGI is based on GNU CHESS
10 * Copyright (c) 1988, 1989, 1990 John Stanback
11 * Copyright (c) 1992 Free Software Foundation
13 * This file is part of GNU SHOGI.
15 * GNU Shogi is free software; you can redistribute it and/or modify it
16 * under the terms of the GNU General Public License as published by the
17 * Free Software Foundation; either version 3 of the License,
18 * or (at your option) any later version.
20 * GNU Shogi is distributed in the hope that it will be useful, but WITHOUT
21 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
22 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25 * You should have received a copy of the GNU General Public License along
26 * with GNU Shogi; see the file COPYING. If not, see
27 * <http://www.gnu.org/licenses/>.
28 * ----------------------------------------------------------------------
35 #define MAX_PATTERN_DATA 5000
36 #define MAX_OPENING_SEQUENCE 20
37 #define MAX_PATTERN 200
39 char *patternfile = PATTERNFILE;
40 small_short pattern_data[MAX_PATTERN_DATA];
42 /* minimal ShowMessage to avoid dependency on extraneous display code */
49 #define is_digit(c) (((c) >= '0') && ((c) <= '9'))
50 #define is_alpha(c) ((((c) >= 'a') && ((c) <= 'z')) \
51 || (((c) >= 'A') && ((c) <= 'Z')))
52 #define eos(s) ((*s == '\0') || (*s == '\n'))
55 /* skip blanks and comments in brackets */
60 while ((**s == ' ') || (**s == '|') || (**s == '['))
73 /* skip unsigned numbers */
86 ScanPiece(char **s, small_short *side,
87 small_short *piece, small_short *square)
91 /* determine promotion status */
93 isp = true, (*s)++; /* FIXME: split into two lines. */
97 /* determine side and piece */
98 for (c = 0; c < NO_PIECES; c++)
100 if ((isw = (**s == pxx[c])) || (**s == qxx[c]))
102 *piece = isp ? promoted[c] : unpromoted[c];
114 /* piece is captured */
116 *square = NO_SQUARES + *piece;
120 /* determine column */
121 for (c = 0; c < NO_COLS; c++)
134 for (r = 0; r < NO_ROWS; r++)
146 /* determine square */
147 *square = r * NO_COLS + c;
156 ScanPattern (char *s, short *pindex)
158 small_short side, piece, square;
159 skipbb(&s); /* skip blanks and comments */
163 pattern_data[(*pindex)++] = atoi(s);
167 pattern_data[(*pindex)++] = END_OF_LINKS;
172 if (ScanPiece(&s, &side, &piece, &square))
178 pattern_data[(*pindex)++] = piece;
179 pattern_data[(*pindex)++] = (side ? -square : square);
184 pattern_data[(*pindex)++] = END_OF_FIELDS;
190 ReadOpeningSequences (short *pindex)
195 short max_pattern = 0;
196 short max_opening_sequence = 0;
198 if ((fd = fopen (patternfile, "r")) == NULL)
199 fd = fopen ("gnushogi.pat", "r");
205 while (fgets (s, 256, fd) != NULL)
209 /* comment, skip line */
211 else if (is_alpha(*s))
213 if (max_opening_sequence++ > 0)
215 pattern_data[(*pindex)++] = END_OF_PATTERNS;
218 pattern_data[(*pindex)++] = ValueOfOpeningName(s);
222 if (ScanPattern(s, pindex))
224 ShowMessage("error in pattern sequence...");
234 pattern_data[(*pindex)++] = END_OF_PATTERNS;
235 pattern_data[(*pindex)++] = END_OF_SEQUENCES;
238 "Pattern: %d bytes for %d sequences with %d patterns.\n",
239 *pindex, max_opening_sequence, max_pattern);
244 sprintf(s, "no pattern file '%s'", patternfile);
251 WriteOpeningSequences (short pindex)
255 short max_pattern = 0;
256 short max_opening_sequence = 0;
258 fd = fopen ("pattern.inc", "w");
259 fprintf(fd, "#define MAX_PATTERN_DATA %d\n\n", pindex);
260 fprintf(fd, "small_short pattern_data[MAX_PATTERN_DATA] =\n{\n");
264 fprintf(fd, " %d,\n", pattern_data[n++]);
271 while (pattern_data[n] != END_OF_LINKS)
273 fprintf(fd, "%d, ", pattern_data[n++]);
276 fprintf(fd, "%d, ", pattern_data[n++]);
281 fprintf(fd, "%d,", pattern_data[n++]);
283 while (pattern_data[n] != END_OF_FIELDS);
285 fprintf(fd, "%d,\n", pattern_data[n++]);
288 while (pattern_data[n] != END_OF_PATTERNS);
290 fprintf(fd, " %d,\n", pattern_data[n++]);
291 max_opening_sequence++;
293 while (pattern_data[n] != END_OF_SEQUENCES);
295 fprintf(fd, " %d\n}; \n", pattern_data[n++]);
296 fprintf(fd, "\n#define MAX_OPENING_SEQUENCE %d\n", max_opening_sequence);
297 fprintf(fd, "\n#define MAX_PATTERN %d\n", max_pattern);