Save hash key in UndoInfo

This to make it possible for the MakeMove and UnMake to update it
at game level during the ponder search.

diff --git a/hachu.c b/hachu.c
index 1ea7853..1f0fcfc 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
@@ -995,6 +995,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 +1067,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
@@ -1183,7 +1188,6 @@ int
 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 +1322,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