Keep track of total piece count always

So far this was only done in ShaMax to implement the baring rule,
but it will come in handy for determination of mating potential.

diff --git a/fairymax.c b/fairymax.c
index ec6c6ca..6c4ea12 100644 (file)
--- a/fairymax.c
+++ b/fairymax.c
@@ -214,7 +214,7 @@ int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
          i+=V;                                 /* promotion / passer bonus */\r
         } if(z&S && GamePtr<6) v+=(rand()>>10&31)-16;\r
         J+=J(0);Z+=J(4)+G-S;\r
-        SHAMAX( pl[k]-=!!t; )                  /* count pieces per side    */\r
+        pl[k]-=!!t;                            /* count pieces per side    */\r
         v+=e+i;V=m>q?m:q;                      /*** new eval & alpha    ****/\r
         if(z&S)V=m-margin>q?m-margin:q;        /* multiPV                  */\r
         C=d-1-(d>5&p>2&!t&!h);                 /* nw depth, reduce non-cpt.*/\r
@@ -240,7 +240,7 @@ int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
                      return l;}                /*   & not in check, signal */\r
          v=m;                                  /* (prevent fail-lows on    */\r
         }                                      /*   K-capt. replies)       */\r
-        SHAMAX( pl[k]+=!!t; ) pl[t&31]+=!!t;\r
+        pl[k]+=!!t;pl[t&31]+=!!t;\r
         b[G]=b[FF];b[FF]=b[y]=0;b[x]=u;b[H]=t; /* undo move,G can be dummy */\r
        }                                       /*          if non-castling */\r
        if(z&S&&K==I&d>2&v>V&v<l){int *p=ps;char X,Y;\r