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 * ----------------------------------------------------------------------
37 /* Declarations of read(), write(), close(), and lseek(). */
47 unsigned booksize = BOOKSIZE;
48 unsigned short bookmaxply = BOOKMAXPLY;
49 unsigned bookcount = 0;
52 char *bookfile = BOOK;
54 char *bookfile = NULL;
58 char *binbookfile = BINBOOK;
60 char *binbookfile = NULL;
63 static char bmvstr[3][7];
66 static ULONG bhashkey;
72 * Generate move strings in different formats.
76 Balgbr(short f, short t, short flag)
78 short promoted = false;
89 piece = f - NO_SQUARES;
91 if (f > (NO_SQUARES + NO_PIECES))
94 flag = (dropmask | piece);
103 if ((f == t) && ((f != 0) || (t != 0)))
106 * error in algbr: FROM=TO=t
109 bmvstr[0][0] = bmvstr[1][0] = bmvstr[2][0] = '\0';
113 if ((flag & dropmask) != 0)
115 /* bmvstr[0]: P*3c bmvstr[1]: P'3c */
116 short piece = flag & pmask;
117 bmvstr[0][0] = pxx[piece];
119 bmvstr[0][2] = cxx[column(t)];
120 bmvstr[0][3] = rxx[row(t)];
121 bmvstr[0][4] = bmvstr[2][0] = '\0';
122 strcpy(bmvstr[1], bmvstr[0]);
127 if ((f != 0) || (t != 0))
129 /* algebraic notation */
130 /* bmvstr[0]: 7g7f bmvstr[1]:
131 * (+)P7g7f(+) bmvstr[2]: (+)P7f(+) */
132 bmvstr[0][0] = cxx[column(f)];
133 bmvstr[0][1] = rxx[row(f)];
134 bmvstr[0][2] = cxx[column(t)];
135 bmvstr[0][3] = rxx[row(t)];
140 bmvstr[1][0] = bmvstr[2][0] = '+';
141 bmvstr[1][1] = bmvstr[2][1] = pxx[board[f]];
142 strcpy(&bmvstr[1][2], &bmvstr[0][0]);
143 strcpy(&bmvstr[2][2], &bmvstr[0][2]);
147 bmvstr[1][0] = bmvstr[2][0] = pxx[board[f]];
148 strcpy(&bmvstr[1][1], &bmvstr[0][0]);
149 strcpy(&bmvstr[2][1], &bmvstr[0][2]);
154 strcat(bmvstr[0], "+");
155 strcat(bmvstr[1], "+");
156 strcat(bmvstr[2], "+");
161 bmvstr[0][0] = bmvstr[1][0] = bmvstr[2][0] = '\0';
172 bkdisplay(char *s, int cnt, int moveno)
179 printf("matches = %d\n", cnt);
180 printf("inout move is :%s: move number %d side %s\n",
181 s, moveno / 2 + 1, (moveno & 1) ? "white" : "black");
183 #ifndef SEMIQUIETBOOKGEN
184 printf("legal moves are \n");
186 while (pnt < TrPnt[3])
190 if (is_promoted[board[node->f]] )
191 Balgbr(node->f | 0x80, node->t, (short) node->flags);
193 Balgbr(node->f, node->t, (short) node->flags);
196 bmvstr[0], bmvstr[1], bmvstr[2]);
199 printf("\n current board is\n");
201 for (r = (NO_ROWS - 1); r >= 0; r--)
203 for (c = 0; c <= (NO_COLS - 1); c++)
208 pc = (is_promoted[board[l]] ? '+' : ' ');
210 if (color[l] == neutral)
212 else if (color[l] == black)
213 printf("%c%c", pc, qxx[board[l]]);
215 printf("%c%c", pc, pxx[board[l]]);
225 for (color = black; color <= white; color++)
229 printf((color == black) ? "black " : "white ");
231 for (piece = pawn; piece <= king; piece++)
233 if ((c = Captured[color][piece]))
234 printf("%i%c ", c, pxx[piece]);
240 #endif /* SEMIQUIETBOOKGEN */
243 #endif /* QUIETBOOKGEN */
248 * BVerifyMove(s, mv, moveno)
250 * Compare the string 's' to the list of legal moves available for the
251 * opponent. If a match is found, make the move on the board.
255 BVerifyMove(char *s, unsigned short *mv, int moveno)
257 static short pnt, tempb, tempc, tempsf, tempst, cnt;
258 static struct leaf xnode;
263 MoveList(opponent, 2, -2, true);
266 while (pnt < TrPnt[3])
270 if (is_promoted[board[node->f]] )
271 Balgbr(node->f | 0x80, node->t, (short) node->flags);
273 Balgbr(node->f, node->t, (short) node->flags);
275 if (strcmp(s, bmvstr[0]) == 0 || strcmp(s, bmvstr[1]) == 0 ||
276 strcmp(s, bmvstr[2]) == 0)
287 MakeMove(opponent, &xnode, &tempb,
288 &tempc, &tempsf, &tempst, &INCscore);
290 if (SqAttacked(PieceList[opponent][0], computer, &blockable))
292 UnmakeMove(opponent, &xnode, &tempb, &tempc, &tempsf, &tempst);
293 /* Illegal move in check */
294 #if !defined QUIETBOOKGEN
295 puts("Illegal move (in check) %s");
296 bkdisplay(s, cnt, moveno);
302 *mv = (xnode.f << 8) | xnode.t;
304 if (is_promoted[board[xnode.t]] )
305 Balgbr(xnode.f | 0x80, xnode.t, false);
307 Balgbr(xnode.f, xnode.t, false);
314 #if !defined QUIETBOOKGEN
315 printf("Illegal move (no match) %s\n", s);
316 bkdisplay(s, cnt, moveno);
327 * Reset the board and other variables to start a new game.
336 flag.illegal = flag.mate = flag.post = flag.quit
337 = flag.reverse = flag.bothsides = flag.onemove = flag.force
340 flag.material = flag.coords = flag.hash = flag.easy
341 = flag.beep = flag.rcptr
344 flag.stars = flag.shade = flag.back = flag.musttimeout = false;
348 CptrFlag[0] = TesujiFlag[0] = false;
352 for (l = 0; l < NO_SQUARES; l++)
354 board[l] = Stboard[l];
355 color[l] = Stcolor[l];
361 hashbd = hashkey = 0;
368 Vparse (FILE * fd, USHORT *mv, USHORT *flags, int moveno)
377 while (((c = getc(fd)) == ' ')
378 || (c == '!') || (c == '/') || (c == '\n'));
382 /* amount of time spent for the last move */
383 while (((c = getc(fd)) != ')') && (c != EOF));
387 while (((c = getc(fd)) == ' ') || (c == '\n'));
393 /* comment for the actual game */
394 while (((c = getc(fd))) != ']' && (c != EOF));
398 while (((c = getc(fd))) == ' ' || (c == '\n'));
414 /* goes to end of line */
427 while ((c >= '0') && (c <= '9'))
435 while (((c = getc(fd)) == ' ') || (c == '.') || (c == '\n'));
439 while (((c = getc(fd)) != '?') && (c != '!') && (c != ' ')
440 && (c != '(') && (c != '\n') && (c != '\t') && (c != EOF))
445 if ((c != 'x') && (c != '-') && (c != ',')
446 && (c != ';') && (c != '='))
456 while (((c = getc(fd)) != ')') && (c != EOF));
467 while ((c != '\n') && (c != EOF))
476 if (strcmp(s, "draw") == 0)
478 else if (strcmp(s, "1-0") == 0)
480 else if (strcmp(s, "0-1") == 0)
482 else if (strcmp(s, "Resigns") == 0)
484 else if (strcmp(s, "Resigns.") == 0)
486 else if (strcmp(s, "Sennichite") == 0)
488 else if (strcmp(s, "Sennichite.") == 0)
490 else if (strcmp(s, "Jishogi") == 0)
492 else if (strcmp(s, "Jishogi.") == 0)
498 i = BVerifyMove(s, mv, moveno);
502 /* Bad move, not for the program to play */
503 *flags |= BADMOVE; /* Flag it ! */
504 while (((c = getc(fd)) == '?') || (c == '!') || (c == '/'));
509 /* Do not use by computer */
510 *flags |= BADMOVE; /* Flag it ! */
512 while (((c = getc(fd)) == '?') || (c == '!') || (c == '/'));
518 *flags |= GOODMOVE; /* Flag it ! */
520 while (((c = getc(fd)) == '?') || (c == '!') || (c == '/'));
528 while (((c = getc(fd)) != ')') && (c != EOF));
532 /* flush to start of next */
533 while (((c = getc(fd)) != '#') && (c != EOF));
551 static struct gdxadmin ADMIN;
553 static struct gdxdata DATA;
555 /* lts(l) returns most significant 16 bits of l */
557 #if SIZEOF_LONG == 8 /* 64-bit long i.e. 8 bytes */
558 # define lts(x) (USHORT)(((x >> 48) & 0xfffe) | side)
560 # if defined USE_LTSIMP
561 static USHORT ltsimp(long x)
564 n = (((x >> 16) & 0xfffe));
567 # define lts(x) (USHORT)(ltsimp(x) | side)
569 # define lts(x) (USHORT)(((x >> 16)&0xfffe) | side)
574 /* #define HashValue(l) lts(l) */
575 #define HashValue(l) (USHORT)(l & 0xffff)
579 static ULONG currentoffset;
582 #define MAXOFFSET(B) ((B.booksize - 1) * sizeof_gdxdata + sizeof_gdxadmin)
584 #define HashOffset(hashkey, B) \
586 currentoffset = ((ULONG)hashkey % B.booksize) \
587 * sizeof_gdxdata + sizeof_gdxadmin; \
591 #define NextOffset(B) \
593 currentoffset += sizeof_gdxdata; \
594 if (currentoffset > B.maxoffset) \
595 currentoffset = sizeof_gdxadmin; \
599 #define WriteAdmin() \
602 write(gfd, (char *)&ADMIN, sizeof_gdxadmin); \
605 #define WriteData() \
609 lseek(gfd, currentoffset, 0); \
610 write(gfd, (char *)&DATA, sizeof_gdxdata); \
615 static int ReadAdmin(void)
618 return (sizeof_gdxadmin == read(gfd, (char *)&ADMIN, sizeof_gdxadmin));
621 static int ReadData(struct gdxdata *DATA)
623 lseek(gfd, currentoffset, 0);
624 return (sizeof_gdxdata == read(gfd, (char *)DATA, sizeof_gdxdata));
631 * CHECKME: is this still valid esp. wrt gnushogi.book?
633 * Read in the Opening Book file and parse the algebraic notation for a move
634 * into an unsigned integer format indicating the from and to square. Create
635 * a linked list of opening lines of play, with entry->next pointing to the
636 * next line and entry->move pointing to a chunk of memory containing the
637 * moves. More Opening lines of up to 100 half moves may be added to
638 * gnushogi.book. But now it's a hashed table by position which yields a move
639 * or moves for each position. It no longer knows about openings per se only
640 * positions and recommended moves in those positions.
648 int mustwrite = false, first;
653 unsigned int games = 0;
659 if ((fd = fopen(bookfile, "r")) == NULL)
660 fd = fopen("gnushogi.tbk", "r");
664 /* yes add to book */
665 /* open book as writer */
666 gfd = open(binbookfile, O_RDONLY | O_BINARY);
672 B.bookcount = ADMIN.bookcount;
673 B.booksize = ADMIN.booksize;
674 B.maxoffset = ADMIN.maxoffset;
676 if (B.booksize && !(B.maxoffset == MAXOFFSET(B)))
678 printf("bad format %s\n", binbookfile);
684 printf("bad format %s\n", binbookfile);
688 gfd = open(binbookfile, O_RDWR | O_BINARY);
693 gfd = open(binbookfile, O_RDWR | O_CREAT | O_BINARY, 0644);
695 ADMIN.bookcount = B.bookcount = 0;
696 ADMIN.booksize = B.booksize = booksize;
697 B.maxoffset = ADMIN.maxoffset = MAXOFFSET(B);
704 write(gfd, (char *)&ADMIN, sizeof_gdxadmin);
705 printf("creating bookfile %s %ld %ld\n",
706 binbookfile, B.maxoffset, B.booksize);
708 for (x = 0; x < B.booksize; x++)
710 write(gfd, (char *)&DATA, sizeof_gdxdata);
716 /* setvbuf(fd, buffr, _IOFBF, 2048); */
718 hashbd = hashkey = 0;
721 while ((c = Vparse(fd, &mv, &flags, i)) >= 0)
726 * If this is not the first move of an opening and
727 * if it's the first time we have seen it then
728 * save the next move as a hint.
732 if (i < bookmaxply + 2)
734 if (i > 1 && !(flags & BADMOVE))
737 if (i < bookmaxply + 1)
740 * See if this position and move already
741 * exist from some other opening.
745 HashOffset(bhashkey, B);
750 if (!ReadData(&DATA))
751 break; /* corrupted binbook file */
754 break; /* free entry */
756 if (DATA.hashkey == HashValue(bhashkey)
757 && DATA.hashbd == bhashbd)
759 if (DATA.bmove == mv)
762 * Yes, so just bump count - count
763 * is used to choose the opening
764 * move in proportion to its
765 * presence in the book.
778 if (DATA.flags & LASTMOVE)
780 DATA.flags &= (~LASTMOVE);
792 * Doesn't exist so add it to the book.
799 if ((B.bookcount % 1000) == 0)
801 /* CHECKME: may want to get rid of this,
802 * especially for xshogi. */
803 printf("%ld rec %d openings "
808 /* initialize a record */
809 DATA.hashbd = bhashbd;
810 DATA.hashkey = HashValue(bhashkey);
812 DATA.flags = flags | LASTMOVE;
821 opponent = computer ^ 1;
827 /* reset for next opening */
838 /* write admin rec with counts */
839 ADMIN.bookcount = B.bookcount;
846 if (binbookfile != NULL)
848 /* open book as reader */
849 gfd = open(binbookfile, O_RDONLY | O_BINARY);
853 if (ReadAdmin() && (!ADMIN.booksize
854 || (ADMIN.maxoffset == MAXOFFSET(ADMIN))))
856 B.bookcount = ADMIN.bookcount;
857 B.booksize = ADMIN.booksize;
858 B.maxoffset = ADMIN.maxoffset;
862 printf("bad format %s\n", binbookfile);
870 B.booksize = booksize;
874 sprintf(msg, "Book used %lu(%lu).", B.bookcount, B.booksize);
875 dsp->ShowMessage(msg);
878 /* Set everything back to start the game. */
882 /* Now get ready to play .*/
885 dsp->ShowMessage("Can't find book.");
895 * Go through each of the opening lines of play and check for a match with
896 * the current game listing. If a match occurs, generate a random
897 * number. If this number is the largest generated so far then the next
898 * move in this line becomes the current "candidate". After all lines are
899 * checked, the candidate move is put at the top of the Tree[] array and
900 * will be played by the program. Note that the program does not handle
901 * book transpositions.
905 OpeningBook(unsigned short *hint)
908 int possibles = TrPnt[2] - TrPnt[1];
910 gsrand((unsigned int) time((long *) 0));
914 * Find all the moves for this position - count them and get their
923 struct gdxdata OBB[128];
925 if (B.bookcount == 0)
932 HashOffset(hashkey, B);
934 printf("looking for book move, bhashbd = 0x%lx bhashkey = 0x%x\n",
935 (ULONG)hashbd, HashValue(hashkey));
939 if (!ReadData(&OBB[x]))
942 if (OBB[x].bmove == 0)
946 printf("compare with bhashbd = 0x%lx bhashkey = 0x%x\n",
947 OBB[x].hashbd, OBB[x].hashkey);
949 if ((OBB[x].hashkey == HashValue(hashkey))
950 && (OBB[x].hashbd == (ULONG)hashbd))
954 if (OBB[x-1].flags & LASTMOVE)
962 printf("%d book move(s) found.\n", x);
971 for (i = 0; i < x; i++)
973 if (OBB[i].flags & BADMOVE)
977 /* Is the move in the MoveList? */
978 for (b = TrPnt[1]; b < (unsigned) TrPnt[2]; b++)
980 if (((Tree[b].f << 8) | Tree[b].t) == m)
983 Tree[b].score = DONTUSE;
992 movealgbr(m = OBB[i].bmove, s);
993 printf("finding book move: %s\n", s);
995 summ += OBB[i].count;
1005 r = (urand() % summ);
1007 for (i = 0; i < x; i++)
1009 if (!(OBB[i].flags & BADMOVE))
1011 if (r < OBB[i].count)
1026 /* Make sure the move is in the MoveList. */
1027 for (b = TrPnt[1]; b < (unsigned) TrPnt[2]; b++)
1029 if (((Tree[b].f << 8) | Tree[b].t) == m)
1031 Tree[b].flags |= book;
1037 /* Make sure it's the best. */
1039 pick(TrPnt[1], TrPnt[2] - 1);
1041 if (Tree[TrPnt[1]].score)
1048 /* Ok, pick up the hint and go. */