MoveList(opponent, 2, -1, true);
generate_move_flags = false;
pnt = TrPnt[2];
+ if(s[4] == '=') s[4] = '\0'; /* deferral is implied */
while (pnt < TrPnt[3])
{
}
}
+/*
+ * Set up a board position. Pieces are entered by typing the piece followed
+ * by the location. For example, Nf3 will place a knight on square f3.
+ */
+static void
+ReadFEN(char *fen)
+{
+ short a = white, r, c, sq, i, error = 0;
+ char s[80];
+
+ flag.regularstart = true;
+ Book = BOOKFAIL;
+
+ for (sq = 0; sq < NO_SQUARES; sq++)
+ {
+ board[sq] = no_piece;
+ color[sq] = neutral;
+ }
+
+ ClearCaptured();
+
+ /* read board */
+ r = NO_ROWS-1; c = 0;
+ while(*fen)
+ {
+ if (isdigit(*fen))
+ {
+ c += *fen++ - '0'; /* assumes single digit! */
+ }
+ else if (*fen == '/')
+ { /* next rank */
+ if (c != NO_COLS) error++;
+ c = 0; fen++;
+ if (--r < 0) break;
+ }
+ else
+ {
+ int promo = 0, found = 0;
+ if (*fen == '+')
+ {
+ promo++; fen++;
+ }
+
+ if (!isalpha(*fen)) break;
+
+ for (i = no_piece; i <= king; i++)
+ {
+ if ((*fen == pxx[i]) || (*fen == qxx[i]))
+ {
+ sq = locn(r, c);
+ color[sq] = (islower(*fen) ? white : black);
+ if (promo)
+ board[sq] = promoted[i];
+ else
+ board[sq] = i;
+
+ found = 1;
+ break;
+ }
+ }
+
+ if (!found) error++;
+ c++; fen++;
+ }
+ }
+ if(r || c != NO_COLS) error++;
+
+ while (*fen == ' ') fen++;
+
+ /* read holdings */
+ if(!strncmp(fen, "[-]", 3)) fen += 3; /* empty holdings */
+ else if(*fen == '[')
+ {
+ fen++;
+ while(isalpha(*fen))
+ {
+ int found = 0;
+ for (i = pawn; i <= king; i++)
+ {
+ if ((*fen == pxx[i]) || (*fen == qxx[i]))
+ {
+ Captured[islower(*fen) ? white : black][i]++;
+ found = 1;
+ break;
+ }
+ }
+ if (!found) error++;
+ fen++;
+ }
+ if(*fen == ']') fen++; else error++;
+ }
+
+ while (*fen == ' ') fen++;
+
+ if (*fen == 'w')
+ a = black;
+ else if (*fen == 'b')
+ a = white;
+ else
+ error++;
+
+ if (error) printf("tellusererror bad FEN\n");
+
+ for (sq = 0; sq < NO_SQUARES; sq++)
+ Mvboard[sq] = ((board[sq] != Stboard[sq]) ? 10 : 0);
+
+ computer = otherside[a];
+ opponent = a;
+ flag.force = true;
+ GameCnt = 0;
+ Game50 = 1;
+ ZeroRPT();
+ Sdepth = 0;
+ InitializeStats();
+}
+
/* FIXME! This is truly the function from hell! */
* the hint move, then set Sdepth to zero.
*/
-void
-InputCommand(char *command)
+int
+InputCommand(char *command, int root)
{
#ifdef QUIETBACKGROUND
short have_shown_prompt = false;
#endif
short ok, done, is_move = false;
unsigned short mv;
- char s[80], sx[80];
+ char s[200], sx[200];
+ static char backlog[200];
ok = flag.quit = done = false;
player = opponent;
ZeroTTable();
#endif
- if ((hint > 0) && !flag.easy && !flag.force)
+ if ((hint > 0) && !flag.easy && !flag.force && !command && !backlog[0] && root)
{
/*
* A hint move for the player is available. Compute a move for the
{
player = opponent;
+ if (flag.analyze && !command && !backlog[0] && root) {
+ SelectMove(opponent, BACKGROUND_MODE);
+ }
+
#ifdef QUIETBACKGROUND
if (!have_shown_prompt)
{
have_shown_prompt = false;
#endif /* QUIETBACKGROUND */
+ if (!command && backlog[0]) command = backlog; /* pick up backlogged command */
+
if (command == NULL) {
int eof = dsp->GetString(sx);
if (eof)
dsp->ExitShogi();
} else {
strcpy(sx, command);
+ backlog[0]= '\0'; /* make sure no backlog is left */
done = true;
}
if (sscanf(sx, "%s", s) < 1)
continue;
+ if (!root && strcmp(s, "."))
+ { /* during search most commands can only be done after abort */
+ strcpy(backlog, sx); /* backlog the command */
+ return true; /* and order search abort */
+ }
+
if (strcmp(s, "bd") == 0) /* bd -- display board */
{
/* FIXME: Hack alert! */
/* noop */ ;
}
else if ((strcmp(s, "quit") == 0) ||
- (strcmp(s, "exit") == 0))
+ (strcmp(s, "exit") == 0) && !xboard)
{
flag.quit = true;
}
}
else if (strcmp(s, "protover") == 0)
{
- printf("feature myname=\"GNU %sShogi %s\" variants=\"%s\" debug=1 setboard=0 sigint=0 done=1\n",
+ printf("feature option=\"tsume -check 0\"\n");
+ printf("feature option=\"contempt -spin %d -1000 1000\"\n", contempt);
+ printf("feature option=\"Hash-file search depth -spin %d 0 100\"\n", HashDepth);
+ printf("feature option=\"Hash-file move number -spin %d 0 100\"\n", HashMoveLimit);
+ printf("feature myname=\"GNU %s %s\" ",
#ifdef MINISHOGI
- "mini", PACKAGE_VERSION, "5x5+5_shogi,mini"
+ "MiniShogi",
#else
- "", PACKAGE_VERSION, "shogi"
+ "Shogi",
#endif
- );
+ PACKAGE_VERSION
+ );
+ printf("variants=\"%s\" ",
+#ifdef MINISHOGI
+ "5x5+5_shogi,minishogi"
+#else
+ "shogi"
+#endif
+ );
+ printf("debug=1 setboard=0 sigint=0 memory=1 setboard=1 done=1\n");
+ }
+ else if (strcmp(s, ".") == 0)
+ { // periodic update request of analysis info: send stat01 info
+ ElapsedTime(2);
+ algbr((short)(currentMove >> 8), (short)(currentMove & 0xFF), 0);
+ printf("stat01: %4ld %8ld %2d %2d %2d %s\n",
+ et, NodeCnt, Sdepth, movesLeft, TrPnt[2]-TrPnt[1], mvstr[0]);
+ fflush(stdout);
+ if (!root) return false; /* signal no abort needed */
+ }
+ else if (strcmp(s, "exit") == 0)
+ {
+ flag.analyze = false;
+ flag.force = true;
+ }
+ else if (strcmp(s, "analyze") == 0)
+ {
+ flag.analyze = true;
+ flag.force = true;
}
else if ((strcmp(s, "set") == 0) ||
(strcmp(s, "edit") == 0))
{
ok = true;
}
+#if ttblsz
+ else if (strcmp(s, "memory") == 0)
+ {
+ unsigned int mem, size, t = 1;
+ sscanf(sx, "memory %d", &mem);
+ if(mem > 2048) mem = 2048; /* prevent integer overflow for > 2GB hash */
+ size = (mem << 20) / sizeof(struct hashentry) - rehash;
+ while(t <= size/4) t <<= 1;
+ AllocateTT(t);
+ }
+#endif
else if (strcmp(s, "go") == 0)
{
ok = true;
NewGame();
dsp->UpdateDisplay(0, 0, 1, 0);
}
+ else if (strcmp(s, "setboard") == 0)
+ {
+ ReadFEN(sx + 9);
+ }
else if (strcmp(s, "list") == 0)
{
ListGame();
{
flag.easy = !flag.easy;
}
+ else if (strcmp(s, "option") == 0)
+ {
+ sscanf(sx, "option tsume=%hd", &flag.tsume) ||
+ sscanf(sx, "option hash=%hd", &flag.hash) ||
+ sscanf(sx, "option Hash-file search depth=%hd", &HashDepth) ||
+ sscanf(sx, "option Hash-file move number=%hd", &HashMoveLimit) ||
+ sscanf(sx, "option contempt=%hd", &contempt);
+ }
else if (strcmp(s, "tsume") == 0)
{
flag.tsume = !flag.tsume;
++mycnt2, s, TimeControl.clock[player] * 10);
}
}
+
+ return true;
}