X-Git-Url: http://winboard.nl/cgi-bin?a=blobdiff_plain;f=fairymax.c;h=94edc780d2e20436d7127b29b468848895bc4f93;hb=dc22c7f5c743ff4ef5243e10b4a050ad1aad4142;hp=c893b3705487af214b7eeb286e958558b1fc191a;hpb=d48770f03a5cbc9a6c1f0606af25ceb73887c012;p=fairymax.git

diff --git a/fairymax.c b/fairymax.c
index c893b37..94edc78 100644
--- a/fairymax.c
+++ b/fairymax.c
@@ -149,7 +149,7 @@ D(k,q,l,e,E,z,n)        /* recursive minimax search, k=moving side, n=depth*/
 int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
 {                       /* e=score, z=prev.dest; J,Z=hashkeys; return score*/
  int j,r,m,v,d,h,i,F,G,P,V,f=J,g=Z,C,s,flag,FF,*ps=sp,kk=S;
- signed char t,p,u,x,y,X,Y,H,B,gt,rg;
+ signed char t,p,u,x,y,X,Y,H,B,gt,rg,rk;
  struct _*a=A+(J+(k+S)*E&U);                   /* lookup pos. in hash table*/
  *sp++=0;
  q-=q<e;l-=l<=e;                               /* adj. window: delay bonus */
@@ -199,7 +199,7 @@ int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
        if(d-!t>1)                              /*** all captures if d=2  ***/
        {v=gt=0;G:                              /* retry move with gating   */
         v+=centr[p]?b[x+257]-b[y+257]:0;       /* center positional pts.   */
-        if(!(G&S))b[FF]=b[G],v+=50;            /* castling: put R & score  */
+        if(G-S)b[FF]=(rk=b[G])|32,v+=50;       /* castling: put R & score  */
         b[G]=b[H]=0;b[x]=gt;b[y]=u|32;         /* do move, set non-virgin  */
         pl[t&31]-=!!t;                         /* updat victim piece count */
         v-=w[p]>0|R<EG?0:20;                   /*** freeze K in mid-game ***/
@@ -232,7 +232,7 @@ int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
         {if(v+I&&x==K&y==L&gt==GT)             /*   if move found          */
          {Q=-e-i;O=F;LL=L;prom=gt;
           if(b[y]-u&15)prom=b[y]-=PromPiece,   /* (under-)promotion:       */
-           Q-=abs(w[prom&=15])-w[p]-6*S,       /*  correct piece & score & */
+           Q-=abs(w[prom&=15])-w[p]-(6*S>>sh), /*  correct piece & score & */
                        Z+=PromPiece;           /*  invalidate hash         */
           a->D=99;a->V=0;                      /* lock game in hash as draw*/
           R-=i/FAC;                            /*** total captd material ***/
@@ -242,7 +242,7 @@ int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
          v=m;                                  /* (prevent fail-lows on    */
         }                                      /*   K-capt. replies)       */
         SHAMAX( pl[k]+=!!t; ) pl[t&31]+=!!t;
-        b[G]=b[FF];b[FF]=b[y]=0;b[x]=u;b[H]=t; /* undo move,G can be dummy */
+        b[G]=rk;b[FF]=b[y]=0;b[x]=u;b[H]=t;    /* undo move,G can be dummy */
        }                                       /*          if non-castling */
        if(z&S&&K==I&d>2&v>V&v<l){int *p=ps;char X,Y;
         if(Post){
@@ -498,6 +498,7 @@ void LoadGame(char *name)
         /* We have found variant, or if none specified, are at beginning of file */
         if(fscanf(f, "%dx%d", &BW, &BH)!=2 || BW>12 || BH!=8)
         { printf("telluser unsupported board size %dx%d\n",BW,BH); exit(0); }
+        makruk = 0; if(fscanf(f, "=%d", &i)) makruk=64; // new method to indicate deviant zone depth (for now assumes 3)
 
         for(i=0; i<BW; i++) fscanf(f, "%d", oo+i);
         for(i=0; i<BW; i++) fscanf(f, "%d", oo+i+16);
@@ -521,7 +522,6 @@ void LoadGame(char *name)
 
         fclose(f);
 	sh = w[7] < 250 ? 3 : 0;
-	makruk = w[7]==181 ? 64 : 0; // w[7] is used as kludge to enable makruk promotions
         if(name == selectedFairy) {
             printf(ptc == 1 ? "setup " : "setup (%s) ", pieceToChar); // setup board in GUI
             for(i=0; i<BW; i++) printf("%c", piecename[oo[i+16]]+'`'); printf("/");