4 * ----------------------------------------------------------------------
6 * Copyright (c) 2012 Free Software Foundation
8 * GNU SHOGI is based on GNU CHESS
10 * This file is part of GNU SHOGI.
12 * GNU Shogi is free software; you can redistribute it and/or modify it
13 * under the terms of the GNU General Public License as published by the
14 * Free Software Foundation; either version 3 of the License,
15 * or (at your option) any later version.
17 * GNU Shogi is distributed in the hope that it will be useful, but WITHOUT
18 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
19 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
22 * You should have received a copy of the GNU General Public License along
23 * with GNU Shogi; see the file COPYING. If not, see
24 * <http://www.gnu.org/licenses/>.
25 * ----------------------------------------------------------------------
34 /* Declarations of read(), write(), close(), and lseek(). */
44 unsigned booksize = BOOKSIZE;
45 unsigned short bookmaxply = BOOKMAXPLY;
46 unsigned bookcount = 0;
49 char *bookfile = BOOK;
51 char *bookfile = NULL;
55 char *binbookfile = BINBOOK;
57 char *binbookfile = NULL;
60 static char bmvstr[3][7];
63 static ULONG bhashkey;
69 * Generate move strings in different formats.
73 Balgbr(short f, short t, short flag)
75 short promoted = false;
86 piece = f - NO_SQUARES;
88 if (f > (NO_SQUARES + NO_PIECES))
91 flag = (dropmask | piece);
100 if ((f == t) && ((f != 0) || (t != 0)))
103 * error in algbr: FROM=TO=t
106 bmvstr[0][0] = bmvstr[1][0] = bmvstr[2][0] = '\0';
110 if ((flag & dropmask) != 0)
112 /* bmvstr[0]: P*3c bmvstr[1]: P'3c */
113 short piece = flag & pmask;
114 bmvstr[0][0] = pxx[piece];
116 bmvstr[0][2] = cxx[column(t)];
117 bmvstr[0][3] = rxx[row(t)];
118 bmvstr[0][4] = bmvstr[2][0] = '\0';
119 strcpy(bmvstr[1], bmvstr[0]);
124 if ((f != 0) || (t != 0))
126 /* algebraic notation */
127 /* bmvstr[0]: 7g7f bmvstr[1]:
128 * (+)P7g7f(+) bmvstr[2]: (+)P7f(+) */
129 bmvstr[0][0] = cxx[column(f)];
130 bmvstr[0][1] = rxx[row(f)];
131 bmvstr[0][2] = cxx[column(t)];
132 bmvstr[0][3] = rxx[row(t)];
137 bmvstr[1][0] = bmvstr[2][0] = '+';
138 bmvstr[1][1] = bmvstr[2][1] = pxx[board[f]];
139 strcpy(&bmvstr[1][2], &bmvstr[0][0]);
140 strcpy(&bmvstr[2][2], &bmvstr[0][2]);
144 bmvstr[1][0] = bmvstr[2][0] = pxx[board[f]];
145 strcpy(&bmvstr[1][1], &bmvstr[0][0]);
146 strcpy(&bmvstr[2][1], &bmvstr[0][2]);
151 strcat(bmvstr[0], "+");
152 strcat(bmvstr[1], "+");
153 strcat(bmvstr[2], "+");
158 bmvstr[0][0] = bmvstr[1][0] = bmvstr[2][0] = '\0';
169 bkdisplay(char *s, int cnt, int moveno)
176 printf("matches = %d\n", cnt);
177 printf("inout move is :%s: move number %d side %s\n",
178 s, moveno / 2 + 1, (moveno & 1) ? "white" : "black");
180 #ifndef SEMIQUIETBOOKGEN
181 printf("legal moves are \n");
183 while (pnt < TrPnt[3])
187 if (is_promoted[board[node->f]] )
188 Balgbr(node->f | 0x80, node->t, (short) node->flags);
190 Balgbr(node->f, node->t, (short) node->flags);
193 bmvstr[0], bmvstr[1], bmvstr[2]);
196 printf("\n current board is\n");
198 for (r = (NO_ROWS - 1); r >= 0; r--)
200 for (c = 0; c <= (NO_COLS - 1); c++)
205 pc = (is_promoted[board[l]] ? '+' : ' ');
207 if (color[l] == neutral)
209 else if (color[l] == black)
210 printf("%c%c", pc, qxx[board[l]]);
212 printf("%c%c", pc, pxx[board[l]]);
222 for (color = black; color <= white; color++)
226 printf((color == black) ? "black " : "white ");
228 for (piece = pawn; piece <= king; piece++)
230 if ((c = Captured[color][piece]))
231 printf("%i%c ", c, pxx[piece]);
237 #endif /* SEMIQUIETBOOKGEN */
240 #endif /* QUIETBOOKGEN */
245 * BVerifyMove(s, mv, moveno)
247 * Compare the string 's' to the list of legal moves available for the
248 * opponent. If a match is found, make the move on the board.
252 BVerifyMove(char *s, unsigned short *mv, int moveno)
254 static short pnt, tempb, tempc, tempsf, tempst, cnt;
255 static struct leaf xnode;
260 MoveList(opponent, 2, -2, true);
263 while (pnt < TrPnt[3])
267 if (is_promoted[board[node->f]] )
268 Balgbr(node->f | 0x80, node->t, (short) node->flags);
270 Balgbr(node->f, node->t, (short) node->flags);
272 if (strcmp(s, bmvstr[0]) == 0 || strcmp(s, bmvstr[1]) == 0 ||
273 strcmp(s, bmvstr[2]) == 0)
284 MakeMove(opponent, &xnode, &tempb,
285 &tempc, &tempsf, &tempst, &INCscore);
287 if (SqAttacked(PieceList[opponent][0], computer, &blockable))
289 UnmakeMove(opponent, &xnode, &tempb, &tempc, &tempsf, &tempst);
290 /* Illegal move in check */
291 #if !defined QUIETBOOKGEN
292 /* 077: "Illegal move (in check) %s" */
295 bkdisplay(s, cnt, moveno);
301 *mv = (xnode.f << 8) | xnode.t;
303 if (is_promoted[board[xnode.t]] )
304 Balgbr(xnode.f | 0x80, xnode.t, false);
306 Balgbr(xnode.f, xnode.t, false);
313 #if !defined QUIETBOOKGEN
314 /* 075: "Illegal move (no match)%s\n" */
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, USHORT side, 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;
649 unsigned short xside, side;
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); */
719 hashbd = hashkey = 0;
722 while ((c = Vparse(fd, &mv, &flags, side, i)) >= 0)
727 * If this is not the first move of an opening and
728 * if it's the first time we have seen it then
729 * save the next move as a hint.
733 if (i < bookmaxply + 2)
735 if (i > 1 && !(flags & BADMOVE))
738 if (i < bookmaxply + 1)
741 * See if this position and move already
742 * exist from some other opening.
746 HashOffset(bhashkey, B);
751 if (!ReadData(&DATA))
752 break; /* corrupted binbook file */
755 break; /* free entry */
757 if (DATA.hashkey == HashValue(bhashkey)
758 && DATA.hashbd == bhashbd)
760 if (DATA.bmove == mv)
763 * Yes, so just bump count - count
764 * is used to choose the opening
765 * move in proportion to its
766 * presence in the book.
779 if (DATA.flags & LASTMOVE)
781 DATA.flags &= (~LASTMOVE);
793 * Doesn't exist so add it to the book.
800 if ((B.bookcount % 1000) == 0)
802 /* CHECKME: may want to get rid of this,
803 * especially for xshogi. */
804 printf("%ld rec %d openings "
809 /* initialize a record */
810 DATA.hashbd = bhashbd;
811 DATA.hashkey = HashValue(bhashkey);
813 DATA.flags = flags | LASTMOVE;
822 opponent = computer ^ 1;
829 /* reset for next opening */
842 /* write admin rec with counts */
843 ADMIN.bookcount = B.bookcount;
850 if (binbookfile != NULL)
852 /* open book as reader */
853 gfd = open(binbookfile, O_RDONLY | O_BINARY);
857 if (ReadAdmin() && (!ADMIN.booksize
858 || (ADMIN.maxoffset == MAXOFFSET(ADMIN))))
860 B.bookcount = ADMIN.bookcount;
861 B.booksize = ADMIN.booksize;
862 B.maxoffset = ADMIN.maxoffset;
866 printf("bad format %s\n", binbookfile);
874 B.booksize = booksize;
878 /* 213: "Book used %d(%d)." */
879 sprintf(msg, CP[213], B.bookcount, B.booksize);
883 /* Set everything back to start the game. */
887 /* Now get ready to play .*/
890 /* 212: "Can't find book." */
891 ShowMessage(CP[212]);
899 * OpeningBook(hint, side)
901 * Go through each of the opening lines of play and check for a match with
902 * the current game listing. If a match occurs, generate a random
903 * number. If this number is the largest generated so far then the next
904 * move in this line becomes the current "candidate". After all lines are
905 * checked, the candidate move is put at the top of the Tree[] array and
906 * will be played by the program. Note that the program does not handle
907 * book transpositions.
911 OpeningBook(unsigned short *hint, short side)
914 int possibles = TrPnt[2] - TrPnt[1];
916 gsrand((unsigned int) time((long *) 0));
920 * Find all the moves for this position - count them and get their
929 struct gdxdata OBB[128];
931 if (B.bookcount == 0)
938 HashOffset(hashkey, B);
940 printf("looking for book move, bhashbd = 0x%lx bhashkey = 0x%x\n",
941 (ULONG)hashbd, HashValue(hashkey));
945 if (!ReadData(&OBB[x]))
948 if (OBB[x].bmove == 0)
952 printf("compare with bhashbd = 0x%lx bhashkey = 0x%x\n",
953 OBB[x].hashbd, OBB[x].hashkey);
955 if ((OBB[x].hashkey == HashValue(hashkey))
956 && (OBB[x].hashbd == (ULONG)hashbd))
960 if (OBB[x-1].flags & LASTMOVE)
968 printf("%d book move(s) found.\n", x);
977 for (i = 0; i < x; i++)
979 if (OBB[i].flags & BADMOVE)
983 /* Is the move in the MoveList? */
984 for (b = TrPnt[1]; b < (unsigned) TrPnt[2]; b++)
986 if (((Tree[b].f << 8) | Tree[b].t) == m)
989 Tree[b].score = DONTUSE;
998 movealgbr(m = OBB[i].bmove, s);
999 printf("finding book move: %s\n", s);
1001 summ += OBB[i].count;
1011 r = (urand() % summ);
1013 for (i = 0; i < x; i++)
1015 if (!(OBB[i].flags & BADMOVE))
1017 if (r < OBB[i].count)
1032 /* Make sure the move is in the MoveList. */
1033 for (b = TrPnt[1]; b < (unsigned) TrPnt[2]; b++)
1035 if (((Tree[b].f << 8) | Tree[b].t) == m)
1037 Tree[b].flags |= book;
1043 /* Make sure it's the best. */
1045 pick(TrPnt[1], TrPnt[2] - 1);
1047 if (Tree[TrPnt[1]].score)
1054 /* Ok, pick up the hint and go. */