fairymax.c

   1 /***************************************************************************/\r
   2 /*                               fairy-Max,                                */\r
   3 /* Version of the sub-2KB (source) micro-Max Chess program, fused to a     */\r
   4 /* generic WinBoard interface, loading its move-generator tables from file */\r
   5 /***************************************************************************/\r
   6 \r
   7      /*****************************************************************/\r
   8      /*                      LICENCE NOTIFICATION                     */\r
   9      /* Fairy-Max 4.8 is free software, and you have my permission do */\r
  10      /* with it whatever you want, whether it is commercial or not.   */\r
  11      /* Note, however, that Fairy-Max can easily be configured through*/\r
  12      /* its fmax.ini file to play Chess variants that are legally pro-*/\r
  13      /* tected by patents, and that to do so would also require per-  */\r
  14      /* mission of the holders of such patents. No guarantees are     */\r
  15      /* given that Fairy-Max does anything in particular, or that it  */\r
  16      /* would not wreck the hardware it runs on, and running it is    */\r
  17      /* entirely for your own risk.  H.G,Muller, author of Fairy-Max  */\r
  18      /*****************************************************************/\r
  19 \r
  20 #define MULTIPATH\r
  21 #define VERSION "4.8Q"\r
  22 \r
  23 #include <stdio.h>\r
  24 #include <stdlib.h>\r
  25 #include <string.h>\r
  26 #include <signal.h>\r
  27 #include <time.h>\r
  28 \r
  29 #ifndef INI_FILE \r
  30 #define INI_FILE "fmax.ini"\r
  31 #endif\r
  32 \r
  33 #ifdef WIN32 \r
  34 #    include <windows.h>\r
  35 #else\r
  36 #    include <sys/time.h>\r
  37      int GetTickCount() // with thanks to Tord\r
  38      {  struct timeval t;\r
  39         gettimeofday(&t, NULL);\r
  40         return t.tv_sec*1000 + t.tv_usec/1000;\r
  41      }\r
  42 #endif\r
  43 \r
  44 int StartKey;\r
  45 \r
  46 #define EMPTY -1\r
  47 #define WHITE 0\r
  48 #define BLACK 16\r
  49 \r
  50 #define STATE 128\r
  51 \r
  52 /* The following macros indicate the differences between Fairy-Max and its */\r
  53 /* dedicated Shatranj derivative ShaMax so that these can now be compiled  */\r
  54 /* from the same unified source file.                                      */\r
  55 /* Compile with gcc option -DSHATRANJ to build ShaMax.                     */\r
  56 #ifdef SHATRANJ\r
  57 #    define FAC 175\r
  58 #    define EG  13\r
  59 #    define NAME "ShaMax"\r
  60 #    define SHAMAX(x) x\r
  61 #    define FMAX(x)\r
  62 #else\r
  63 #    define FAC 128\r
  64 #    define EG  10\r
  65 #    define NAME "Fairy-Max"\r
  66 #    define SHAMAX(x)\r
  67 #    define FMAX(x) x\r
  68 #endif\r
  69 \r
  70 /* make unique integer from engine move representation */\r
  71 #define PACK_MOVE 256*K + L + (PromPiece << 16);\r
  72 \r
  73 /* convert intger argument back to engine move representation */\r
  74 #define UNPACK_MOVE(A) K = (A)>>8 & 255; L = (A) & 255; PromPiece = (A)>>16 & 255;\r
  75 \r
  76 /* Global variables visible to engine. Normally they */\r
  77 /* would be replaced by the names under which these  */\r
  78 /* are known to your engine, so that they can be     */\r
  79 /* manipulated directly by the interface.            */\r
  80 \r
  81 int Side;\r
  82 int Move;\r
  83 int PromPiece;\r
  84 int Result;\r
  85 int TimeLeft;\r
  86 int MovesLeft;\r
  87 int MaxDepth;\r
  88 int Post;\r
  89 int Fifty;\r
  90 int UnderProm;\r
  91 int GameNr;\r
  92 int Resign;\r
  93 int Threshold = 800;\r
  94 int Score;\r
  95 int makruk;\r
  96 int prom, pm, gating;\r
  97 char piecename[32], piecetype[32], blacktype[32];\r
  98 char selectedFairy[80];\r
  99 char *inifile = INI_FILE;\r
 100 \r
 101 int Ticks, tlim, Setup, SetupQ;\r
 102 \r
 103 int GameHistory[1024];\r
 104 char HistoryBoards[1024][STATE], setupPosition[162];\r
 105 int GamePtr, HistPtr;\r
 106 \r
 107 #define W while\r
 108 #define K(A,B) *(int*)(T+A+S*(B&31))\r
 109 #define J(A) K(y+A,b[y])-K(x+A,u)-K(H+A,t)\r
 110 \r
 111 int U=(1<<23)-1;\r
 112 struct _ {int K,V;char X,Y,D,F;} *A;           /* hash table, 16M+8 entries*/\r
 113 \r
 114 int M=136,S=128,I=8e3,Q,O,K,N,j,R,J,Z,LL,GT,   /* M=0x88                   */\r
 115 BW,BH,sh,\r
 116 w[16]={0,2,2,-1,7,8,12,23,7,5},                /* relative piece values    */\r
 117 o[256],\r
 118 oo[32],                                        /* initial piece setup      */\r
 119 of[256],\r
 120 od[16];                                        /* 1st dir. in o[] per piece*/\r
 121 \r
 122 signed char L,pl[32],\r
 123 b[513],                                        /* board: 16x8+dummy, + PST */\r
 124 T[4104],                                       /* hash translation table   */\r
 125 centr[32],\r
 126 n[]=".*XKNBRQEWFMACHG?x+knbrqewfmachg";        /* piece symbols on printout*/\r
 127 \r
 128 int pv[10000],*sp=pv; // triangular array\r
 129 int margin;\r
 130 \r
 131 pboard()\r
 132 {int i;\r
 133  i=-1;W(++i<128)printf(" %c",(i&15)==BW&&(i+=15-BW)?10:n[b[i]&31]);\r
 134 }\r
 135          \r
 136 \r
 137 D(k,q,l,e,E,z,n)        /* recursive minimax search, k=moving side, n=depth*/\r
 138 int k,q,l,e,E,z,n;      /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/\r
 139 {                       /* e=score, z=prev.dest; J,Z=hashkeys; return score*/\r
 140  int j,r,m,v,d,h,i,F,G,P,V,f=J,g=Z,C,s,flag,FF,*ps=sp,kk=S;\r
 141  signed char t,p,u,x,y,X,Y,H,B,gt;\r
 142  struct _*a=A+(J+(k+S)*E&U-1);                 /* lookup pos. in hash table*/\r
 143  *sp++=0;\r
 144  q-=q<e;l-=l<=e;                               /* adj. window: delay bonus */\r
 145  d=a->D;m=a->V;X=a->F;Y=a->Y;                  /* resume at stored depth   */\r
 146  if(a->K-Z|z&S  |                              /* miss: other pos. or empty*/\r
 147   !(m<=q|X&8&&m>=l|X&S))                       /*   or window incompatible */\r
 148   d=Y=0;                                       /* start iter. from scratch */\r
 149  X=a->X;                                       /* start at best-move hint  */\r
 150  W(d++<n||d<3||              /*** min depth = 2   iterative deepening loop */\r
 151    z&S&&K==I&&(GetTickCount()-Ticks<tlim&d<=MaxDepth|| /* root: deepen upto time   */\r
 152    (K=X,L=Y&~S,Score=m,d=3)))                  /* time's up: go do best    */\r
 153  {x=B=X;                                       /* start scan at prev. best */\r
 154   h=Y&S;                                       /* request try noncastl. 1st*/\r
 155   P=d>2&&l+I?D(16-k,-l,1-l,-e,2*S,2*S,d-3):I;  /* search null move         */\r
 156   m=-P<l|R<5?d-2?-I:e:-P;   /*** prune if > beta  unconsidered:static eval */\r
 157   SHAMAX( if(pl[k]<=1&pl[16-k]>1)m=I-1; )      /* bare king loses          */\r
 158   N++;                                         /* node count (for timing)  */\r
 159   do{u=b[x];                                   /* scan board looking for   */\r
 160    if(u&&(u&16)==k)                            /*  own piece (inefficient!)*/\r
 161    {r=p=u&15;                                  /* p = piece type (set r>0) */\r
 162     j=od[p];                                   /* first step vector f.piece*/\r
 163     W(r=o[++j])                                /* loop over directions o[] */\r
 164     {A:                                        /* resume normal after best */\r
 165      flag=h?3:of[j];                           /* move modes (for fairies) */\r
 166      y=x;F=FF=G=S;                             /* (x,y)=move, (F,G)=castl.R*/\r
 167      do{                                       /* y traverses ray, or:     */\r
 168       H=y=h?Y^h:y+r;                           /* sneak in prev. best move */\r
 169       if(flag&1<<8)H=y=(y&15)>13?y+BW:(y&15)>=BW?y-BW:y; /* cylinder board */\r
 170       if(y&S|(y&15)>=BW)break;                 /* board edge hit           */\r
 171 #ifdef MULTIPATH\r
 172       if(flag&1<<9)                            /* if multipath move        */\r
 173       {t=flag>>12;                             /* get dir. stepped twice   */\r
 174        if(b[x+t]){if(b[y-2*t]|b[y-t])break;}else \r
 175        if(b[x+2*t]&&b[y-t])break;              /* test if empty path exists*/\r
 176       }\r
 177 #endif\r
 178       m=E<16|(E^112)<16&&flag&1&y-E<2&E-y<2?I:m;      /* bad castling  */\r
 179       if(p<3&y==E)H=z&127;                     /* shift capt.sqr. H if e.p.*/\r
 180       t=b[H];\r
 181       if(flag&1+!t)                            /* mode (capt/nonc) allowed?*/\r
 182       {if(t&&(t&16)==k)break;                  /* capture own              */\r
 183        i=w[t&15]+((t&192)>>sh);                /* value of capt. piece t   */\r
 184        if(i<0&&(pl[t&31]<2||                   /* K capture, (of last K),  */\r
 185         t>>3&kk!=H&kk!=S||(kk=H,i=-i,0)))m=I,d=98;/* or duple check: cutoff*/\r
 186        if(m>=l&d>1)goto C;                     /* abort on fail high       */\r
 187        v=d-1?e:i-p;                            /*** MVV/LVA scoring if d=1**/\r
 188        if(d-!t>1)                              /*** all captures if d=2  ***/\r
 189        {v=gt=0;G:                              /* retry move with gating   */\r
 190         v+=centr[p]?b[x+257]-b[y+257]:0;       /* center positional pts.   */\r
 191         if(!(G&S))b[FF]=b[G],v+=50;            /* castling: put R & score  */\r
 192         b[G]=b[H]=0;b[x]=gt;b[y]=u|32;         /* do move, set non-virgin  */\r
 193         pl[t&31]-=!!t;                         /* updat victim piece count */\r
 194         v-=w[p]>0|R<EG?0:20;                   /*** freeze K in mid-game ***/\r
 195         if(p<3)                                /* pawns:                   */\r
 196         {v-=9*((x-2&M||b[x-2]-u)+              /* structure, undefended    */\r
 197                (x+2&M||b[x+2]-u)               /*        squares plus bias */\r
 198               +(w[b[x^16]&15]<0))              /*** cling to magnetic K ***/\r
 199               +(R-76>>2);                      /* end-game Pawn-push bonus */\r
 200          b[y]+=V=y+r+1&S?647-p|pm:2*(u&y+16&32);/*upgrade P or convert to Q*/\r
 201          if(V&makruk)b[y]=u|7,V=480;           /* Makruk promotion on 6th  */\r
 202          V>>=sh;                               /* for Shatranj promo to F  */\r
 203          i+=V;                                 /* promotion / passer bonus */\r
 204         } if(z&S && GamePtr<6) v+=(rand()>>10&31)-16;\r
 205         J+=J(0);Z+=J(4)+G-S;\r
 206         SHAMAX( pl[k]-=!!t; )                  /* count pieces per side    */\r
 207         v+=e+i;V=m>q?m:q;                      /*** new eval & alpha    ****/\r
 208         if(z&S)V=m-margin>q?m-margin:q;        /* multiPV                  */\r
 209         C=d-1-(d>5&p>2&!t&!h);                 /* nw depth, reduce non-cpt.*/\r
 210         C=R<EG|P-I|d<3||t&&p-3?C:d;            /* extend 1 ply if in-check */\r
 211         do\r
 212          s=C>2|v>V?-D(16-k,-l,-V,-v,/*** futility, recursive eval. of reply */\r
 213                                      F,y&255,C):v;\r
 214         W(s>q&++C<d); v=s;                     /* no fail:re-srch unreduced*/\r
 215         if(v>V&v<l){int *p=sp;\r
 216          sp=ps+1;\r
 217          W(*sp++=*p++);\r
 218          *ps=256*x+y;\r
 219         }\r
 220         if(z&S&&K-I)                           /* move pending: check legal*/\r
 221         {if(v+I&&x==K&y==L&gt==GT)             /*   if move found          */\r
 222          {Q=-e-i;O=F;LL=L;prom=gt;\r
 223           if(b[y]-u&15)prom=b[y]-=PromPiece,   /* under-promotion, correct */\r
 224                        J+=PromPiece;           /*  piece & invalidate hash */\r
 225           a->D=99;a->V=0;                      /* lock game in hash as draw*/\r
 226           R-=i/FAC;                            /*** total captd material ***/\r
 227           Fifty = t|p<3?0:Fifty+1;\r
 228           sp=ps;\r
 229                      return l;}                /*   & not in check, signal */\r
 230          v=m;                                  /* (prevent fail-lows on    */\r
 231         }                                      /*   K-capt. replies)       */\r
 232         SHAMAX( pl[k]+=!!t; ) pl[t&31]+=!!t;\r
 233         b[G]=b[FF];b[FF]=b[y]=0;b[x]=u;b[H]=t; /* undo move,G can be dummy */\r
 234        }                                       /*          if non-castling */\r
 235        if(z&S&&K==I&d>2&v>V&v<l){int *p=ps;char X,Y;\r
 236         if(Post){\r
 237          printf("%2d ",d-2);\r
 238          printf("%6d ",v);\r
 239          printf("%8d %10d",(GetTickCount()-Ticks)/10,N);\r
 240          while(*p){X=*p>>8;Y=*p++;\r
 241          printf(" %c%c%c%c",'a'+(X&15),'8'-(X>>4),'a'+(Y&15),'8'-(Y>>4&7));}\r
 242          printf("\n");fflush(stdout);\r
 243         }GT=gt;                                /* In root, remember gated  */\r
 244        }\r
 245        if(v>m)                                 /* new best, update max,best*/\r
 246         m=v,X=x,Y=y|S&F;                       /* mark non-double with S   */\r
 247        if(gating&&!(u&32)&&p>2&&d-!t>1){       /* virgin non-Pawn: gate    */\r
 248         pl[(gt|=k+40)-27]++;                   /* prev. gated back in hand */\r
 249         if(m>=l)goto C;                        /* loop skips cutoff :-(    */\r
 250         W(++gt<k+43)if(pl[gt-27]){             /* look if more to gate     */\r
 251          pl[gt-27]--;v=10;goto G;              /* remove from hand & retry */\r
 252        }}\r
 253        J=f;Z=g;\r
 254        if(h){h=0;goto A;}                      /* redo after doing old best*/\r
 255       }\r
 256       s=t;v=r^flag>>12;                        /* calc. alternated vector  */\r
 257       if(flag&15^4|u&32||                      /* no double or moved before*/\r
 258          p>2&&                                 /* no P & no lateral K move,*/\r
 259          ((b[G=r<0?x&~15:BW-1|x&112]^32)<33    /* no virgin R in corner G, */\r
 260          ||b[G^1]|b[G^2]|b[FF=y+v-r])          /* no 2 empty sq. next to R */\r
 261         )t+=flag&4;                            /* fake capt. for nonsliding*/\r
 262       else if(flag&64)t=flag&128?0:t,flag&=63;else F=y; /* enable e.p.     */\r
 263       if(s&&flag&8)t=0,flag^=flag>>4&15;       /* hoppers go to next phase */\r
 264       if(!(flag&S))                            /* zig-zag piece?           */\r
 265        r=v,flag^=flag>>4&15;                   /* alternate vector & mode  */\r
 266      }W(!t);                                   /* if not capt. continue ray*/\r
 267    }}\r
 268    if((++x&15)>=BW)x=x+16&112;                 /* next sqr. of board, wrap */\r
 269   }W(x-B);           \r
 270 C:FMAX( m=m+I|P==I?m:(X=Y=0); )                /* if stalemate, draw-score */\r
 271   if(a->D<99)                                  /* protect game history     */\r
 272    a->K=Z,a->V=m,a->D=d,a->X=X,                /* always store in hash tab */\r
 273    a->F=8*(m>q)|S*(m<l),a->Y=Y;                /* move, type (bound/exact),*/\r
 274   }                                            /*    encoded in X S,8 bits */\r
 275 if(z&4*S)K=X,L=Y&~S;\r
 276  sp=ps;\r
 277  return m+=m<e;                                /* delayed-loss bonus       */\r
 278 }\r
 279 \r
 280 \r
 281 /* Generic main() for Winboard-compatible engine     */\r
 282 /* (Inspired by TSCP)                                */\r
 283 /* Author: H.G. Muller                               */\r
 284 \r
 285 /* The engine is invoked through the following       */\r
 286 /* subroutines, that can draw on the global vaiables */\r
 287 /* that are maintained by the interface:             */\r
 288 /* Side         side to move                         */\r
 289 /* Move         move input to or output from engine  */\r
 290 /* PromPiece    requested piece on promotion move    */\r
 291 /* TimeLeft     ms left to next time control         */\r
 292 /* MovesLeft    nr of moves to play within TimeLeft  */\r
 293 /* MaxDepth     search-depth limit in ply            */\r
 294 /* Post         boolean to invite engine babble      */\r
 295 \r
 296 /* InitEngine() progran start-up initialization      */\r
 297 /* InitGame()   initialization to start new game     */\r
 298 /*              (sets Side, but not time control)    */\r
 299 /* Think()      think up move from current position  */\r
 300 /*              (leaves move in Move, can be invalid */\r
 301 /*               if position is check- or stalemate) */\r
 302 /* DoMove()     perform the move in Move             */\r
 303 /*              (togglese Side)                      */\r
 304 /* ReadMove()   convert input move to engine format  */\r
 305 /* PrintMove()  print Move on standard output        */\r
 306 /* Legal()      check Move for legality              */\r
 307 /* ClearBoard() make board empty                     */\r
 308 /* PutPiece()   put a piece on the board             */\r
 309 \r
 310 /* define this to the codes used in your engine,     */\r
 311 /* if the engine hasn't defined it already.          */\r
 312 \r
 313 int PrintResult(int s)\r
 314 {\r
 315         int i, j, k, cnt=0;\r
 316 \r
 317         /* search last 50 states with this stm for third repeat */\r
 318         for(j=2; j<=100 && j <= HistPtr; j+=2)\r
 319         {\r
 320             for(k=0; k<STATE; k++)\r
 321                 if(HistoryBoards[HistPtr][k] !=\r
 322                    HistoryBoards[HistPtr-j&1023][k] )\r
 323                    {\r
 324                      goto differs;}\r
 325             /* is the same, count it */\r
 326             if(++cnt > 1) /* third repeat */\r
 327             {\r
 328                 printf("1/2-1/2 {Draw by repetition}\n");\r
 329                 return 1;\r
 330             }\r
 331           differs: ;\r
 332         }\r
 333         K=I;\r
 334         cnt = D(s,-I,I,Q,O,LL|4*S,3);\r
 335 #ifdef SHATRANJ\r
 336         if(pl[s]==1 && pl[16-s]==1) {\r
 337                 printf("1/2-1/2 {Insufficient mating material}\n");\r
 338                 return 4;\r
 339         }\r
 340         if(pl[s]<=1 && pl[16-s]>1) {\r
 341                 if (s == BLACK)\r
 342                         printf("0-1 {Bare King}\n");\r
 343                 else\r
 344                         printf("1-0 {Bare King}\n");\r
 345                 return 5;\r
 346         }\r
 347 #else\r
 348         if(cnt>-I+1 && K==0 && L==0) {\r
 349                 printf("1/2-1/2 {Stalemate}\n");\r
 350                 return 2;\r
 351         }\r
 352 #endif\r
 353         if(cnt==-I+1) {\r
 354                 if (s == WHITE)\r
 355                         printf("0-1 {Black mates}\n");\r
 356                 else\r
 357                         printf("1-0 {White mates}\n");\r
 358                 return 3;\r
 359         }\r
 360         if(Fifty >=100) {\r
 361                 printf("1/2-1/2 {Draw by fifty move rule}\n");\r
 362                 return 4;\r
 363         }\r
 364         return 0;\r
 365 }\r
 366 \r
 367 \r
 368 InitEngine()\r
 369 {\r
 370  int i, j;\r
 371 \r
 372  N=32*S+7;W(N-->S+3)T[N]=rand()>>9;\r
 373  srand(GetTickCount());\r
 374 }\r
 375 \r
 376 InitGame()\r
 377 {\r
 378  int i,j,k=0;\r
 379 \r
 380  Side = WHITE; Q=0; O=S;\r
 381  Fifty = 0; R = 0;\r
 382  for(i=0;i<16*BH;i++)b[i]=0;\r
 383  for(i=0;i<32;i++)pl[i]=0;\r
 384  K=BW;W(K--)\r
 385  {b[K]=oo[K+16]+16;b[K+112]=oo[K];b[K+16]=18;b[K+96]=1; /* initial board setup*/\r
 386   pl[oo[K+16]+16]++;pl[oo[K]]++;pl[18]++;pl[1]++;\r
 387   if(w[oo[K+16]+16] == -1)pl[oo[K+16]+16]=1;\r
 388   if(w[oo[K]] == -1)pl[oo[K]]=1;\r
 389   L=8;W(L--)b[16*L+K+257]=(K-BW/2)*(K-BW/2)+(L-3.5)*(L-3.5); /* center-pts table   */\r
 390  }                                                   /*(in unused half b[])*/\r
 391  for(i=0; i<BW; i++) {\r
 392   R += abs(w[oo[i]])/FAC + abs(w[oo[i+16]])/FAC;\r
 393   Q += abs(w[oo[i]]) - abs(w[oo[i+16]]) + w[1] - w[2];\r
 394   if(w[oo[i]] < 0) k = w[oo[i]];\r
 395  }\r
 396  R -= 2*(-k/FAC);\r
 397  UnderProm = -1; pl[WHITE] = pl[BLACK] = 2*BW; \r
 398  pm = !pl[BLACK+7] && pl[BLACK+9] && pl[WHITE+7] ? 2 : 0; // Unlike white, black has no 'Q', so promote to 9, which he does have.\r
 399  if(gating) pl[14] = pl[15] = pl[30] = pl[31] = 1, R += 2*(w[9]/FAC + w[10]/FAC);\r
 400 }\r
 401 \r
 402 void CopyBoard(int s)\r
 403 {\r
 404         int i, j, k, cnt=0;\r
 405 \r
 406         /* copy game representation of engine to HistoryBoard */\r
 407         /* don't forget castling rights and e.p. state!       */\r
 408         for(i=0; i<BH; i++)\r
 409         for(j=0; j<BW; j++)                 /* board squares  */\r
 410             HistoryBoards[s][BW*i+j] = b[16*i+j]|64*(16*i+j==O);\r
 411 }\r
 412                                          \r
 413 void PrintVariants(int combo)\r
 414 {\r
 415         int i, j, count=0, total=0; char c=EOF+1, buf[80];\r
 416         FILE *f;\r
 417 \r
 418         f = fopen(INI_FILE, "r");\r
 419         if(f==NULL) return;\r
 420 \r
 421         /* search for game names in definition file */\r
 422         do {\r
 423            while(fscanf(f, "Game: %s", buf) != 1 && c != EOF) \r
 424                while((c = fgetc(f)) != EOF && c != '\n');\r
 425            if(c == EOF) break;\r
 426            total++;\r
 427            if(combo == (strstr(buf, "fairy/") != buf)) continue;\r
 428            if(combo && count == 0) strcpy(selectedFairy, buf);\r
 429            if(count++) printf(combo ? " /// " : ",");\r
 430            printf("%s", combo ? buf+6 : buf);\r
 431         } while(c != EOF);\r
 432 \r
 433         fclose(f);\r
 434         if(!combo && total != count) printf("%sfairy", count ? "," : "");\r
 435 }\r
 436 \r
 437 void PrintOptions()\r
 438 {\r
 439         printf("feature option=\"Resign -check %d\"\n", Resign);\r
 440         printf("feature option=\"Resign Threshold -spin %d 200 1200\"\n", Threshold);\r
 441         printf("feature option=\"Ini File -file %s\"\n", inifile);\r
 442         printf("feature option=\"Multi-PV Margin -spin %d 0 1000\"\n", margin);\r
 443         printf("feature option=\"Variant fairy selects -combo "); PrintVariants(1); printf("\"\n");\r
 444         printf("feature option=\"Dummy Slider Example -slider 20 0 100\"\n");\r
 445         printf("feature option=\"Dummy String Example -string happy birthday!\"\n");\r
 446         printf("feature option=\"Dummy Path Example -path .\"\n");\r
 447         printf("feature option=\"Clear Hash -button\"\n");\r
 448         printf("feature done=1\n");\r
 449 }\r
 450                                          \r
 451 int LoadGame(char *name)\r
 452 {\r
 453         int i, j, ptc, count=0; char c, buf[80], pieceToChar[80];\r
 454         static int currentVariant;\r
 455         FILE *f;\r
 456 \r
 457         f = fopen(inifile, "r");\r
 458         if(f==NULL)\r
 459         {   printf("telluser piece-desription file '%s'  not found\n", inifile);\r
 460             exit(0);\r
 461         }\r
 462         if(fscanf(f, "version 4.8(%c)", &c)!=1 || c != 'w')\r
 463         { printf("telluser incompatible fmax.ini file\n"); exit(0); }\r
 464 \r
 465         gating = 0;\r
 466         if(name != NULL)\r
 467         {  /* search for game name in definition file */\r
 468            if(!strcmp(name, "fairy")) name = selectedFairy;\r
 469            gating = !strcmp(name, "seirawan");\r
 470            while((ptc=fscanf(f, "Game: %s # %s", buf, pieceToChar))==0 || strcmp(name, buf) ) {\r
 471                while((c = fgetc(f)) != EOF && c != '\n');\r
 472                count++;\r
 473                if(c == EOF) {\r
 474                    printf("telluser variant %s not supported\n", name);\r
 475                    fclose(f);\r
 476                    return; /* keep old settings */\r
 477                }\r
 478            }\r
 479            currentVariant = count;\r
 480         }\r
 481 \r
 482         /* We have found variant, or if none specified, are at beginning of file */\r
 483         if(fscanf(f, "%dx%d", &BW, &BH)!=2 || BW>12 || BH!=8)\r
 484         { printf("telluser unsupported board size %dx%d\n",BW,BH); exit(0); }\r
 485 \r
 486         for(i=0; i<BW; i++) fscanf(f, "%d", oo+i);\r
 487         for(i=0; i<BW; i++) fscanf(f, "%d", oo+i+16);\r
 488         for(i= 0; i<=U; i++)\r
 489             A[i].K = A[i].D = A[i].X = A[i].Y = A[i].F = 0; /* clear hash */\r
 490         for(i=0; i<32; i++) piecetype[i] = blacktype[i] = 0;\r
 491 \r
 492         i=0; j=-1; c=0;\r
 493         while(fscanf(f, "%d,%x", o+j, of+j)==2 ||\r
 494                                       fscanf(f,"%c:%d",&c, w+i+1)==2)\r
 495         {   if(c)\r
 496             { od[++i]=j; centr[i] = c>='a';\r
 497               blacktype[c&31]=i; piecename[i]=c&31;\r
 498               if(piecetype[c&31]==0) piecetype[c&31]=i; // only first\r
 499             }\r
 500             j++; o[j]=0;\r
 501             /* printf("# c='%c' i=%d od[i]=%d j=%d (%3d,%8x)\n",c?c:' ',i,od[i],j,o[j-1],of[j-1]); /**/\r
 502             c=0; if(i>15 || j>255) break;\r
 503         }\r
 504 \r
 505         fclose(f);\r
 506         sh = w[7] < 250 ? 3 : 0;\r
 507         makruk = w[7]==181 ? 64 : 0; // w[7] is used as kludge to enable makruk promotions\r
 508         if(name == selectedFairy) {\r
 509             printf(ptc == 1 ? "setup " : "setup (%s) ", pieceToChar); // setup board in GUI\r
 510             for(i=0; i<BW; i++) printf("%c", piecename[oo[i+16]]+'`'); printf("/");\r
 511             for(i=0; i<BW; i++) printf("%c", piecename[2]+'`'); printf("/");\r
 512             for(i=2; i<BH-2; i++) printf("%d/", BW);\r
 513             for(i=0; i<BW; i++) printf("%c", piecename[1]+'@'); printf("/");\r
 514             for(i=0; i<BW; i++) printf("%c", piecename[oo[i]]+'@'); printf(" w KQkq - 0 1\n");\r
 515         }\r
 516 }\r
 517 \r
 518 int main(int argc, char **argv)\r
 519 {\r
 520         int Computer, MaxTime, MaxMoves, TimeInc, sec, i, j;\r
 521         char line[256], command[256], c, cc;\r
 522         int m, nr;\r
 523         FILE *f;\r
 524 \r
 525         if(argc>1 && sscanf(argv[1], "%d", &m)==1)\r
 526         { U = (1<<m)-1; argc--; argv++; }\r
 527         A = (struct _ *) calloc(U+1, sizeof(struct _));\r
 528         if(argc>1) inifile = argv[1];\r
 529 \r
 530         signal(SIGINT, SIG_IGN);\r
 531         printf("tellics say     " NAME " " VERSION "\n");\r
 532         printf("tellics say     by H.G. Muller\n");\r
 533         printf("tellics say Gothic Chess is protected by U.S. patent #6,481,716 by Ed Trice.\n");\r
 534         printf("tellics say Falcon Chess is protected by U.S. patent #5,690,334 by George W. Duke\n");\r
 535         InitEngine();\r
 536         LoadGame(NULL);\r
 537         InitGame();\r
 538         Computer = EMPTY;\r
 539         MaxTime  = 10000;  /* 10 sec */\r
 540         MaxDepth = 30;     /* maximum depth of your search */\r
 541 \r
 542         for (;;) {\r
 543                 fflush(stdout);\r
 544                 if (Side == Computer) {\r
 545                         /* think up & do move, measure time used  */\r
 546                         /* it is the responsibility of the engine */\r
 547                         /* to control its search time based on    */\r
 548                         /* MovesLeft, TimeLeft, MaxMoves, TimeInc */\r
 549                         /* Next 'MovesLeft' moves have to be done */\r
 550                         /* within TimeLeft+(MovesLeft-1)*TimeInc  */\r
 551                         /* If MovesLeft<0 all remaining moves of  */\r
 552                         /* the game have to be done in this time. */\r
 553                         /* If MaxMoves=1 any leftover time is lost*/\r
 554                         Ticks = GetTickCount();\r
 555                         m = MovesLeft<=0 ? 40 : MovesLeft;\r
 556                         tlim = (0.6-0.06*(BW-8))*(TimeLeft+(m-1)*TimeInc)/(m+7);\r
 557                         if(tlim>TimeLeft/15) tlim = TimeLeft/15;\r
 558                         PromPiece = 0; /* Always promote to Queen ourselves */\r
 559                         N=0;K=I;\r
 560                         if (D(Side,-I,I,Q,O,LL|S,3)==I) {\r
 561                             Side ^= BLACK^WHITE;\r
 562                             if(UnderProm>=0 && UnderProm != L)\r
 563                             {    printf("tellics I hate under-promotions!\n");\r
 564                                  printf("resign { underpromotion } \n");\r
 565                                  Computer = EMPTY;\r
 566                                  continue;\r
 567                             } else UnderProm = -1;\r
 568                             printf("move ");\r
 569                             printf("%c%c%c%c",'a'+(K&15),'0'+BH-(K>>4),\r
 570                                           'a'+(L&15),'0'+BH-(L>>4));\r
 571                             if(prom)printf("%c",piecename[prom&15]+'a'-1);\r
 572                             printf("\n");\r
 573                             m = GetTickCount() - Ticks;\r
 574 \r
 575                             /* time-control accounting */\r
 576                             TimeLeft -= m;\r
 577                             TimeLeft += TimeInc;\r
 578                             if(--MovesLeft == 0) {\r
 579                                 MovesLeft = MaxMoves;\r
 580                                 if(MaxMoves == 1)\r
 581                                      TimeLeft  = MaxTime;\r
 582                                 else TimeLeft += MaxTime;\r
 583                             }\r
 584 \r
 585                             GameHistory[GamePtr++] = PACK_MOVE;\r
 586                             CopyBoard(HistPtr=HistPtr+1&1023);\r
 587                             if(Resign && Score <= -Threshold) { \r
 588                                 printf("resign\n"); Computer=EMPTY;\r
 589                             } else if(PrintResult(Side))\r
 590                                 Computer = EMPTY;\r
 591                         } else {\r
 592                             if(!PrintResult(Side))\r
 593                                 printf("resign { refuses own move }\n");\r
 594                             Computer = EMPTY;\r
 595                         }\r
 596                         continue;\r
 597                 }\r
 598                 if (!fgets(line, 256, stdin))\r
 599                         return;\r
 600                 if (line[0] == '\n')\r
 601                         continue;\r
 602                 sscanf(line, "%s", command);\r
 603                 if (!strcmp(command, "xboard"))\r
 604                         continue;\r
 605                 if (!strcmp(command, "protover")) {\r
 606                         printf("feature myname=\"" NAME " " VERSION "\"\n");\r
 607                         printf("feature memory=1\n");\r
 608                         printf("feature setboard=0 ping=1 done=0\n");\r
 609                         printf("feature variants=\"");\r
 610                         PrintVariants(0);\r
 611                         printf("\"\n");\r
 612                         PrintOptions();\r
 613                         continue;\r
 614                 }\r
 615                 if (!strcmp(command, "ping")) { int nr=0;\r
 616                         sscanf(line, "ping %d", &nr);\r
 617                         printf("pong %d\n", nr);\r
 618                         continue;\r
 619                 }\r
 620                 if (!strcmp(command, "p")) {\r
 621                         pboard();\r
 622                         continue;\r
 623                 }\r
 624                 if (!strcmp(command, "memory")) {\r
 625                         int mem, mask;\r
 626                         sscanf(line+6, "%d", &mem); mem = (mem*1024*1024)/12; // max nr of hash entries\r
 627                         mask = 0x7FFFFFFF; while(mask > mem) mask >>= 1;\r
 628                         if(mask != U) {\r
 629                             free(A); U = mask;\r
 630                             A = (struct _ *) calloc(U+1, sizeof(struct _));\r
 631                         }\r
 632                         continue;\r
 633                 }\r
 634                 if (!strcmp(command, "new")) {\r
 635                         /* start new game */\r
 636                         LoadGame("normal");\r
 637                         InitGame();\r
 638                         GamePtr   = Setup = 0;\r
 639                         GameNr++;\r
 640                         HistPtr   = 0;\r
 641                         Computer  = BLACK;\r
 642                         TimeLeft  = MaxTime;\r
 643                         MovesLeft = MaxMoves;\r
 644                         for(nr=0; nr<1024; nr++)\r
 645                             for(m=0; m<STATE; m++)\r
 646                                 HistoryBoards[nr][m] = 0;\r
 647                         continue;\r
 648                 }\r
 649                 if (!strcmp(command, "quit"))\r
 650                         /* exit engine */\r
 651                         return;\r
 652                 if (!strcmp(command, "force")) {\r
 653                         /* computer plays neither */\r
 654                         Computer = EMPTY;\r
 655                         continue;\r
 656                 }\r
 657                 if (!strcmp(command, "white")) {\r
 658                         /* set white to move in current position */\r
 659                         if(Side == BLACK) Q = -Q;\r
 660                         Side     = WHITE;\r
 661                         Computer = BLACK;\r
 662                         continue;\r
 663                 }\r
 664                 if (!strcmp(command, "black")) {\r
 665                         /* set blck to move in current position */\r
 666                         if(Side == WHITE) Q = -Q;\r
 667                         Side     = BLACK;\r
 668                         Computer = WHITE;\r
 669                         continue;\r
 670                 }\r
 671                 if (!strcmp(command, "st")) {\r
 672                         /* move-on-the-bell mode     */\r
 673                         /* indicated by MaxMoves = 1 */\r
 674                         sscanf(line, "st %d", &MaxTime);\r
 675                         MovesLeft = MaxMoves = 1;\r
 676                         TimeLeft  = MaxTime *= 1000;\r
 677                         TimeInc   = 0;\r
 678                         continue;\r
 679                 }\r
 680                 if (!strcmp(command, "sd")) {\r
 681                         /* set depth limit (remains in force */\r
 682                         /* until next 'sd n' command)        */\r
 683                         sscanf(line, "sd %d", &MaxDepth);\r
 684                         MaxDepth += 2; /* QS depth */\r
 685                         continue;\r
 686                 }\r
 687                 if (!strcmp(command, "level")) {\r
 688                         /* normal or blitz time control */\r
 689                         sec = 0;\r
 690                         if(sscanf(line, "level %d %d %d",\r
 691                                  &MaxMoves, &MaxTime, &TimeInc)!=3 &&\r
 692                            sscanf(line, "level %d %d:%d %d",\r
 693                                  &MaxMoves, &MaxTime, &sec, &TimeInc)!=4)\r
 694                              continue;\r
 695                         MovesLeft = MaxMoves;\r
 696                         TimeLeft  = MaxTime = 60000*MaxTime + 1000*sec;\r
 697                         TimeInc  *= 1000;\r
 698                         continue;\r
 699                 }\r
 700                 if (!strcmp(command, "time")) {\r
 701                         /* set time left on clock */\r
 702                         sscanf(line, "time %d", &TimeLeft);\r
 703                         TimeLeft  *= 10; /* centi-sec to ms */\r
 704                         continue;\r
 705                 }\r
 706                 if (!strcmp(command, "otim")) {\r
 707                         /* opponent's time (not kept, so ignore) */\r
 708                         continue;\r
 709                 }\r
 710                 if (!strcmp(command, "easy")) {\r
 711                         continue;\r
 712                 }\r
 713                 if (!strcmp(command, "hard")) {\r
 714                         continue;\r
 715                 }\r
 716                 if (!strcmp(command, "accepted")) {\r
 717                         continue;\r
 718                 }\r
 719                 if (!strcmp(command, "rejected")) {\r
 720                         continue;\r
 721                 }\r
 722                 if (!strcmp(command, "random")) {\r
 723                         continue;\r
 724                 }\r
 725                 if (!strcmp(command, "option")) {\r
 726                         int i; static char filename[80];\r
 727                         if(sscanf(line+7, "Resign=%d", &Resign) == 1) continue;\r
 728                         if(sscanf(line+7, "Resign Threshold=%d", &Threshold) == 1) continue;\r
 729                         if(sscanf(line+7, "Ini File=%s", filename) == 1) {\r
 730                                 inifile = filename; continue;\r
 731                         }\r
 732                         if(sscanf(line+7, "Clear Hash") == 1) for(i=0; i<U; i++) A->K = 0;\r
 733                         if(sscanf(line+7, "MultiVariation Margin=%d", &margin) == 1) continue;\r
 734                         if(sscanf(line+7, "Variant fairy selects=%s", selectedFairy+6) == 1) continue;\r
 735                         continue;\r
 736                 }\r
 737                 if (!strcmp(command, "go")) {\r
 738                         /* set computer to play current side to move */\r
 739                         Computer = Side;\r
 740                         MovesLeft = -(GamePtr+(Side==WHITE)>>1);\r
 741                         while(MaxMoves>0 && MovesLeft<=0)\r
 742                             MovesLeft += MaxMoves;\r
 743                         continue;\r
 744                 }\r
 745                 if (!strcmp(command, "hint")) {\r
 746                         Ticks = GetTickCount(); tlim = 1000;\r
 747                         D(Side,-I,I,Q,O,LL|4*S,6);\r
 748                         if (K==0 && L==0)\r
 749                                 continue;\r
 750                         printf("Hint: ");\r
 751                         printf("%c%c%c%c",'a'+(K&7),'8'-(K>>4),\r
 752                                           'a'+(L&7),'8'-(L>>4));\r
 753                         printf("\n");\r
 754                         continue;\r
 755                 }\r
 756                 if (!strcmp(command, "undo")   && (nr=1) ||\r
 757                     !strcmp(command, "remove") && (nr=2)   ) {\r
 758                         /* 'take back' moves by replaying game */\r
 759                         /* from history until desired ply      */\r
 760                         if (GamePtr - nr < 0)\r
 761                                 continue;\r
 762                         GamePtr -= nr;\r
 763                         HistPtr -= nr;   /* erase history boards */\r
 764                         while(nr-- > 0)  \r
 765                             for(m=0; m<STATE; m++)\r
 766                                 HistoryBoards[HistPtr+nr+1&1023][m] = 0;\r
 767                         InitGame();\r
 768                         if(Setup) {\r
 769                             for(i=0; i<128; i++) b[i] = setupPosition[i];\r
 770                             for(i=0; i<32; i++) pl[i] = setupPosition[i+130];\r
 771                             Side = setupPosition[128]; Q = SetupQ;\r
 772                             R = setupPosition[129];\r
 773                         }\r
 774                         for(i=0; i<=U; i++) A[i].D = A[i].K = 0; // clear hash table\r
 775                         for(nr=0; nr<GamePtr; nr++) {\r
 776                             UNPACK_MOVE(GameHistory[nr]);\r
 777                             D(Side,-I,I,Q,O,LL|S,3);\r
 778                             Side ^= BLACK^WHITE;\r
 779                         }\r
 780                         continue;\r
 781                 }\r
 782                 if (!strcmp(command, "post")) {\r
 783                         Post = 1;\r
 784                         continue;\r
 785                 }\r
 786                 if (!strcmp(command, "nopost")) {\r
 787                         Post = 0;\r
 788                         continue;\r
 789                 }\r
 790                 if (!strcmp(command, "variant")) {\r
 791                         sscanf(line, "variant %s", command);\r
 792                         LoadGame(command);\r
 793                         InitGame(); Setup = 0;\r
 794                         continue;\r
 795                 }\r
 796                 if (!strcmp(command, "edit")) {\r
 797                         int color = WHITE, p;\r
 798 \r
 799                         while(fgets(line, 256, stdin)) {\r
 800                                 m = line[0];\r
 801                                 if(m=='.') break;\r
 802                                 if(m=='#') {\r
 803                                         for(i=0; i<128; i++) b[i]=0;\r
 804                                         for(i=0; i<32; i++) pl[i]=0;\r
 805                                         Q=0; R=0; O=S;\r
 806                                         pl[WHITE]=pl[BLACK]=0;\r
 807                                         continue;\r
 808                                 }\r
 809                                 if(m=='c') {\r
 810                                         color = WHITE+BLACK - color;\r
 811                                         Q = -Q;\r
 812                                         continue;\r
 813                                 }\r
 814                                 if( m >= 'A' && m <= 'Z' && piecetype[m&31]\r
 815                                     && line[1] >= 'a' && line[1] <= 'a'+BW-1\r
 816                                     && line[2] >= '1' && line[2] <= '0'+BH) {\r
 817                                         m = line[1]-16*line[2]+799;\r
 818                                         switch(p = (color == WHITE ? piecetype : blacktype)[line[0]&31])\r
 819                                         {\r
 820                                         case 1:\r
 821                                         case 2:\r
 822                                             if(color==WHITE)\r
 823                                                  b[m]=(m&0x70)==0x60?1:33,\r
 824                                                  Q+=w[1];\r
 825                                             else b[m]=(m&0x70)==0x10?18:50,\r
 826                                                  Q+=w[2];\r
 827                                             break;\r
 828                                         default:\r
 829                                             b[m]=p+color+32; // assume non-virgin\r
 830                                             if(w[p]<0) { // Royal piece on original square: virgin\r
 831                                                 if(color==BLACK && m<0x10 && p==oo[m+16] ||\r
 832                                                    color==WHITE && m>0x6F && p==oo[m-0x70]) b[m] -= 32;\r
 833                                                 Q-=w[p]; // assume value was flipped to indicate royalty\r
 834                                                 if(pl[p+color])R-=w[p]/FAC; // capturable King, add to material\r
 835                                             } else { Q+=w[p]; R+=w[p]/FAC; }\r
 836                                             if((m==0x00 || m==BW-1   ) && color==BLACK && p==oo[m+16] ||\r
 837                                                (m==0x70 || m==0x6F+BW) && color==WHITE && p==oo[m-0x70])\r
 838                                                 b[m] &= ~32; // corner piece as in original setup: virgin\r
 839                                         case 0: // undefined piece, ignore\r
 840                                             break;\r
 841                                         }\r
 842                                         pl[BLACK+WHITE-color]++;pl[p+color]++;\r
 843                                         if(w[p+color] == -1)pl[p+color]=1; // fake we have one if value = -1, to thwart extinction condition\r
 844                                         continue;\r
 845                                 }\r
 846                         }\r
 847                         if(Side != color) Q = -Q;\r
 848                         GamePtr = HistPtr = 0; Setup = 1; SetupQ = Q; // start anew\r
 849                         for(i=0; i<128; i++) setupPosition[i] = b[i]; // remember position\r
 850                         setupPosition[128] = Side;\r
 851                         setupPosition[129] = R;\r
 852                         for(i=0; i<32; i++) setupPosition[i+130] = pl[i];\r
 853                         Computer = EMPTY; // after edit: force mode!\r
 854                         continue;\r
 855                 }\r
 856                 /* command not recognized, assume input move */\r
 857                 m = line[0]<'a' | line[0]>='a'+BW | line[1]<'1' | line[1]>='1'+BH |\r
 858                     line[2]<'a' | line[2]>='a'+BW | line[3]<'1' | line[3]>='1'+BH;\r
 859                 if(line[4] == '\n') line[4] = 0;\r
 860                 GT = (Side == WHITE ? piecetype : blacktype)[line[4]&31];\r
 861                 if(GT) PromPiece = (Side == WHITE ? 7 : 7+pm) - GT, GT |= 32 + Side;\r
 862                 {char *c=line; K=c[0]-16*c[1]+799;L=c[2]-16*c[3]+799; }\r
 863                 if (m)\r
 864                         /* doesn't have move syntax */\r
 865                         printf("Error (unknown command): %s\n", command);\r
 866                 else { int i=-1;\r
 867                     if(b[L] && (b[L]&16) == Side && w[b[L]&15] < 0) // capture own King: castling\r
 868                     { i=K; K = L; L = i>L ? i-1 : i+2; }\r
 869                     if(b[K]&32) GT = 0; // non-virgin mover => true promotion rather than gating\r
 870                     if(D(Side,-I,I,Q,O,LL|S,3)!=I) {\r
 871                         /* did have move syntax, but illegal move */\r
 872                         printf("Illegal move:%s\n", line);\r
 873                     } else {  /* legal move, perform it */\r
 874                         if(i >= 0) b[i]=b[K],b[K]=0; // reverse Seirawan gating\r
 875                         GameHistory[GamePtr++] = PACK_MOVE;\r
 876                         Side ^= BLACK^WHITE;\r
 877                         CopyBoard(HistPtr=HistPtr+1&1023);\r
 878                         if(PrintResult(Side)) Computer = EMPTY;\r
 879                     }\r
 880                 }\r
 881         }\r
 882 }\r