Remember time of last root iter

diff --git a/hachu.c b/hachu.c
index b28c59a..79c5b75 100644 (file)
--- a/hachu.c
+++ b/hachu.c
@@ -131,7 +131,7 @@ typedef struct {
 char *array, fenArray[4000], *reason;\r
 int bWidth, bHeight, bsize, zone, currentVariant, chuFlag, tenFlag, chessFlag, repDraws;\r
 int stm, xstm, hashKeyH, hashKeyL, framePtr, msp, nonCapts, rootEval, retMSP, retFirst, retDep, pvPtr, level, cnt50, mobilityScore;\r
-int nodes, startTime, tlim1, tlim2, tlim3, repCnt, comp, abortFlag;\r
+int nodes, startTime, lastRootMove, lastRootIter, tlim1, tlim2, tlim3, repCnt, comp, abortFlag;\r
 Move ponderMove;\r
 Move retMove, moveStack[10000], path[100], repStack[300], pv[1000], repeatMove[300], killer[100][2];\r
 \r
@@ -1847,9 +1847,10 @@ if(PATH) printf("%d:%2d:%d %3d %6x %-10s %6d %6d\n", level, depth, iterDep, curM
     } // next move\r
   cutoff:\r
     if(!level) { // root node\r
+      lastRootIter = GetTickCount() - startTime;\r
       if(postThinking > 0) {\r
         int i;   // WB thinking output\r
-       printf("%d %d %d %d", iterDep, bestScore, (GetTickCount() - startTime)/10, nodes);\r
+       printf("%d %d %d %d", iterDep, bestScore, lastRootIter/10, nodes);\r
         if(ponderMove) printf(" (%s)", MoveToText(ponderMove, 0));\r
        for(i=0; pv[i]; i++) printf(" %s", MoveToText(pv[i], 0));\r
         if(iterDep == 1) printf(" { root eval = %4.2f dif = %4.2f; abs = %4.2f}", curEval/100., difEval/100., PSTest()/100.);\r