Add some debug prints

[hachu.git] / hachu.c

diff --git a/hachu.c b/hachu.c
index 1ea7853..f7846b8 100644 (file)
--- a/hachu.c
+++ b/hachu.c
@@ -81,7 +81,7 @@ typedef struct {
 } PieceDesc;\r
 \r
 typedef struct {\r
-  int from, to, piece, victim, new, booty, epSquare, epVictim, ep2Square, ep2Victim;\r
+  int from, to, piece, victim, new, booty, epSquare, epVictim, ep2Square, ep2Victim, savKeyL, savKeyH;\r
 } UndoInfo;\r
 \r
 int stm, xstm, hashKeyH, hashKeyL, framePtr, msp, nonCapts, retMSP, retFirst, level, chuFlag=1;\r
@@ -675,10 +675,13 @@ AddMove (int i, int x, int y)
 }\r
 #endif\r
 \r
+int flag;\r
+\r
 inline int\r
 NewNonCapture (int x, int y, int promoFlags)\r
 {\r
   if(board[y] != EMPTY) return 1; // edge, capture or own piece\r
+//if(flag) printf("# add %c%d%c%d, pf=%d\n", x%BW+'a',x/BW,y%BW+'a',y/BW, promoFlags);\r
   if( (promoBoard[x] | promoBoard[y]) & promoFlags) { // piece can promote with this move\r
     moveStack[msp++] = moveStack[nonCapts];           // create space for promotion\r
     moveStack[nonCapts++] = x<<SQLEN | y | PROMOTE;   // push promotion\r
@@ -690,6 +693,7 @@ NewNonCapture (int x, int y, int promoFlags)
     }\r
   } else\r
     moveStack[msp++] = x<<SQLEN | y; // push normal move\r
+//if(flag) printf("msp=%d nc=%d\n", msp, nonCapts);    \r
   return 0;\r
 }\r
 \r
@@ -995,6 +999,8 @@ MakeMove(Move m, UndoInfo *u)
   u->piece = board[u->from];\r
   board[u->from] = EMPTY;\r
   u->booty = 0;\r
+  u->savKeyL = hashKeyL;\r
+  u->savKeyH = hashKeyH;\r
 \r
   if(m & (PROMOTE | DEFER)) {\r
     if(m & DEFER) {\r
@@ -1065,6 +1071,9 @@ UnMake(UndoInfo *u)
   p[u->new].pos = ABSENT; \r
   p[u->piece].pos = u->from; // this can be the same as above\r
   board[u->from] = u->piece;\r
+\r
+  hashKeyL = u->savKeyL;\r
+  hashKeyH = u->savKeyH;\r
 }\r
        \r
 void\r
@@ -1177,13 +1186,10 @@ Evaluate ()
   return 0;\r
 }\r
 \r
-int flag;\r
-\r
 int\r
 Search (int alpha, int beta, int difEval, int depth, int oldPromo, int promoSuppress)\r
 {\r
   int i, j, k, firstMove, oldMSP = msp, curMove, sorted, bad, phase, king, iterDep, replyDep, nextVictim, to, defer, dubious, bestMoveNr;\r
-  int savHashL = hashKeyL, savHashH = hashKeyH;\r
   int score, bestScore, curEval, iterAlpha;\r
   Move move, nullMove;\r
   UndoInfo tb;\r
@@ -1318,8 +1324,6 @@ if(PATH) pmap(attacks, stm);
 attacks -= 2*BSIZE;\r
 level--;\r
       UnMake(&tb);\r
-      hashKeyL = savHashL;\r
-      hashKeyH = savHashH;\r
       xstm = stm; stm ^= WHITE;\r
 #if 1\r
 if(PATH) printf("%d:%2d:%d %3d %6x %-10s %6d %6d\n", level, depth, iterDep, curMove, moveStack[curMove], MoveToText(moveStack[curMove], 0), score, bestScore);\r
@@ -1551,6 +1555,7 @@ MapFromScratch(attacks);
   if(i>=retMSP) {  // no exact match\r
     if(deferred) { // but maybe non-sensical deferral\r
       int flags = p[board[f]].promoFlag;\r
+printf("# deferral of %d\n", deferred);\r
       i = deferred; // in any case we take that move\r
       if(!(flags & promoBoard[t] & (CANT_DEFER | LAST_RANK))) { // but change it into a deferral if that is allowed\r
        moveStack[i] &= ~PROMOTE;\r