#define EMPTY 0\r
#define EDGE (1<<11)\r
#define TYPE (WHITE|BLACK|EDGE)\r
-#define ABSENT 4095\r
+#define ABSENT 2047\r
#define INF 8000\r
#define NPIECES 2000 /* length of piece list */\r
\r
char age;\r
} HashEntry; // hash-table entry\r
\r
+ // Some global variables that control your engine's behavior\r
+ int ponder;\r
+ int randomize;\r
+ int postThinking;\r
+ int resign; // engine-defined option\r
+ int contemptFactor; // likewise\r
+\r
int squareKey[BSIZE];\r
\r
int rawBoard[BSIZE + 11*BW + 6];\r
break;\r
case 7: // bad captures\r
case 8: // PV null move\r
+ phase = 9;\r
+ if(nullMove != ABSENT) {\r
+ moveStack[msp++] = nullMove + (nullMove << SQLEN) | DEFER; // kludge: setting DEFER guarantees != 0, and has no effect\r
+ }\r
+printf("# %d. sqr = %08x null = %08x\n", msp, nullMove, moveStack[msp-1]);\r
case 9:\r
goto cutoff;\r
}\r
} // next move\r
cutoff:\r
if(!level) { // root node\r
+ if(postThinking > 0) {\r
+ int i; // WB thinking output\r
+ printf("%d %d %d %d", iterDep, bestScore, (GetTickCount() - startTime)/10, nodes);\r
+ for(i=0; pv[i]; i++) printf(" %s", MoveToText(pv[i], 0));\r
+ printf("\n"); fflush(stdout);\r
+ }\r
if(GetTickCount() - startTime > tlim1) break; // do not start iteration we can (most likely) not finish\r
}\r
replyDep = iterDep;\r
{\r
static char buf[50];\r
int f = move>>SQLEN & SQUARE, g = f, t = move & SQUARE;\r
+ if(f == t) { sprintf(buf, "@@@@"); return buf; } // null-move notation in WB protocol\r
buf[0] = '\0';\r
if(t >= SPECIAL) { // kludgy! Print as side effect non-standard WB command to remove victims from double-capture (breaks hint command!)\r
int e = f + epList[t - SPECIAL];\r
ParseMove (char *moveText)\r
{\r
int i, j, f, t, t2, e, ret, deferred=0;\r
+ char c = moveText[0];\r
moveText += ReadSquare(moveText, &f);\r
moveText += ReadSquare(moveText, &t); t2 = t;\r
if(*moveText == ',') {\r
}\r
ret = f<<SQLEN | t2;\r
if(*moveText == '+') ret |= PROMOTE;\r
+printf("# suppress = %c%d\n", sup1%BW+'a', sup1/BW);\r
MapFromScratch(attacks);\r
+ postThinking--;\r
Search(-INF-1, INF+1, 0, 1, sup1, sup2);\r
+ postThinking++;\r
for(i=retFirst; i<retMSP; i++) {\r
+ if(moveStack[i] == INVALID) continue;\r
+ if(c == '@' && (moveStack[i] & SQUARE) == (moveStack[i] >> SQLEN & SQUARE)) break; // any null move matches @@@@\r
if((moveStack[i] & (PROMOTE | DEFER-1)) == ret) break;\r
if((moveStack[i] & DEFER-1) == ret) deferred = i; // promoted version of entered non-promotion is legal\r
}\r
ReadSquare(coords, &sqr);\r
MapFromScratch(attacks);\r
flag=1;\r
+ postThinking--;\r
Search(-INF-1, INF+1, 0, 1, sup1, sup2);\r
+ postThinking++;\r
flag=0;\r
for(i=retFirst; i<retMSP; i++) {\r
if(sqr == (moveStack[i]>>SQLEN & SQUARE)) {\r
{\r
}\r
\r
- // Some global variables that control your engine's behavior\r
- int ponder;\r
- int randomize;\r
- int postThinking;\r
- int resign; // engine-defined option\r
- int contemptFactor; // likewise\r
-\r
int TakeBack(int n)\r
{ // reset the game and then replay it to the desired point\r
int last, stm;\r
if(!strcmp(command, "ics")) { continue; }\r
if(!strcmp(command, "accepted")){ continue; }\r
if(!strcmp(command, "rejected")){ continue; }\r
+ if(!strcmp(command, "result")) { continue; }\r
if(!strcmp(command, "hover")) { continue; }\r
if(!strcmp(command, "")) { continue; }\r
if(!strcmp(command, "usermove")){\r