1 /***************************************************************************/
\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
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
21 #define VERSION "4.8S"
\r
30 #define INI_FILE "fmax.ini"
\r
34 # include <windows.h>
\r
35 # define CPUtime 1000.*clock
\r
37 # include <sys/time.h>
\r
38 # include <sys/times.h>
\r
39 # include <unistd.h>
\r
40 int GetTickCount() // with thanks to Tord
\r
42 gettimeofday(&t, NULL);
\r
43 return t.tv_sec*1000 + t.tv_usec/1000;
\r
46 { // get CPU time used by process, converted to 'MILLICLOCKS'
\r
47 struct tms cpuTimes;
\r
49 if(!cps) cps = sysconf(_SC_CLK_TCK);
\r
51 return ((double)(cpuTimes.tms_utime + cpuTimes.tms_stime) * CLOCKS_PER_SEC * 1000)/cps;
\r
63 /* The following macros indicate the differences between Fairy-Max and its */
\r
64 /* dedicated Shatranj derivative ShaMax so that these can now be compiled */
\r
65 /* from the same unified source file. */
\r
66 /* Compile with gcc option -DSHATRANJ to build ShaMax. */
\r
70 # define NAME "ShaMax"
\r
71 # define SHAMAX(x) x
\r
76 # define NAME "Pair-o-Max"
\r
81 /* make unique integer from engine move representation */
\r
82 #define PACK_MOVE 256*K + L + (PromPiece << 16) + (GT<<24);
\r
84 /* convert intger argument back to engine move representation */
\r
85 #define UNPACK_MOVE(A) K = (A)>>8 & 255; L = (A) & 255; PromPiece = (A)>>16 & 255; GT = (A)>>24 & 255;
\r
87 /* Global variables visible to engine. Normally they */
\r
88 /* would be replaced by the names under which these */
\r
89 /* are known to your engine, so that they can be */
\r
90 /* manipulated directly by the interface. */
\r
104 int Threshold = 800;
\r
107 int prom, pm, gating, succession;
\r
108 char piecename[32], piecetype[32], blacktype[32];
\r
109 char selectedFairy[80];
\r
110 char *inifile = INI_FILE;
\r
112 int Ticks, tlim, Setup, SetupQ;
\r
114 int GameHistory[1024];
\r
115 char HistoryBoards[1024][STATE], setupPosition[162];
\r
116 int GamePtr, HistPtr;
\r
119 #define K(A,B) *(int*)(T+A+S*(B&31))
\r
120 #define J(A) K(y+A,b[y])-K(x+A,u)-K(H+A,t)
\r
123 struct _ {int K,V;char X,Y,D,F;} *A; /* hash table, 16M+8 entries*/
\r
125 int M=136,S=128,I=8e3,Q,O,K,N,j,R,J,Z,LL,GT, /* M=0x88 */
\r
127 w[16]={0,2,2,-1,7,8,12,23,7,5}, /* relative piece values */
\r
129 oo[32], /* initial piece setup */
\r
131 od[16]; /* 1st dir. in o[] per piece*/
\r
133 signed char L,pl[32],pb[32],
\r
134 b[513], /* board: 16x8+dummy, + PST */
\r
135 T[4104], /* hash translation table */
\r
137 n[]=".*XKNBRQEWFMACHG?x+knbrqewfmachg"; /* piece symbols on printout*/
\r
139 int pv[10000],*sp=pv; // triangular array
\r
144 i=-1;W(++i<128)printf(" %c",(i&15)==BW&&(i+=15-BW)?10:n[b[i]&31]);
\r
148 D(k,q,l,e,E,z,n) /* recursive minimax search, k=moving side, n=depth*/
\r
149 int k,q,l,e,E,z,n; /* (q,l)=window, e=current eval. score, E=e.p. sqr.*/
\r
150 { /* e=score, z=prev.dest; J,Z=hashkeys; return score*/
\r
151 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
152 signed char t,p,u,x,y,X,Y,H,B,gt;
\r
153 struct _*a=A+(J+(k+S)*E&U); /* lookup pos. in hash table*/
\r
155 q-=q<e;l-=l<=e; /* adj. window: delay bonus */
\r
156 d=a->D;m=a->V;X=a->F;Y=a->Y; /* resume at stored depth */
\r
157 if(a->K-Z|z&S | /* miss: other pos. or empty*/
\r
158 !(m<=q|X&8&&m>=l|X&S)) /* or window incompatible */
\r
159 d=Y=0; /* start iter. from scratch */
\r
160 X=a->X; /* start at best-move hint */
\r
161 W(d++<n||d<3|| /*** min depth = 2 iterative deepening loop */
\r
162 z&S&&K==I&&(GetTickCount()-Ticks<tlim&d<=MaxDepth|| /* root: deepen upto time */
\r
163 (K=X,L=Y&~S,Score=m,d=3))) /* time's up: go do best */
\r
164 {x=B=X; /* start scan at prev. best */
\r
165 h=Y&S; /* request try noncastl. 1st*/
\r
166 P=d>2&&l+I?D(16-k,-l,1-l,-e,2*S,2*S,d-3):I; /* search null move */
\r
167 m=-P<l|R<5?d-2?-I:e:-P; /*** prune if > beta unconsidered:static eval */
\r
168 SHAMAX( if(pl[k]<=1&pl[16-k]>1)m=I-1; ) /* bare king loses */
\r
169 N++; /* node count (for timing) */
\r
170 do{u=b[x]; /* scan board looking for */
\r
171 if(u&&(u&16)==k) /* own piece (inefficient!)*/
\r
172 {r=p=u&15; /* p = piece type (set r>0) */
\r
173 j=od[p]; /* first step vector f.piece*/
\r
174 W(r=o[++j]) /* loop over directions o[] */
\r
175 {A: /* resume normal after best */
\r
176 flag=h?3:of[j]; /* move modes (for fairies) */
\r
177 y=x;F=FF=G=S; /* (x,y)=move, (F,G)=castl.R*/
\r
178 do{ /* y traverses ray, or: */
\r
179 H=y=h?Y^h:y+r; /* sneak in prev. best move */
\r
180 if(flag&1<<8)H=y=(y&15)>13?y+BW:(y&15)>=BW?y-BW:y; /* cylinder board */
\r
181 if(y&S|(y&15)>=BW)break; /* board edge hit */
\r
183 if(flag&1<<9) /* if multipath move */
\r
184 {t=flag>>12; /* get dir. stepped twice */
\r
185 if(b[x+t]){if(b[y-2*t]|b[y-t])break;}else
\r
186 if(b[x+2*t]&&b[y-t])break; /* test if empty path exists*/
\r
189 m=E<16|(E^112)<16&&flag&1&y-E<2&E-y<2?I:m; /* bad castling */
\r
190 if(p<3&y==E&flag)H=z&127; /* shift capt.sqr. H if e.p.*/
\r
192 if(flag&1+!t) /* mode (capt/nonc) allowed?*/
\r
193 {if(t&&(t&16)==k)break; /* capture own */
\r
194 i=w[t&15]+((t&192)>>sh); /* value of capt. piece t */
\r
195 if(i<0&&(pl[t&31]<2|| /* K capture, (of last K), */
\r
196 t>>3&kk!=H&kk!=S||(kk=H,i=-i,0)))m=I,d=98;/* or duple check: cutoff*/
\r
197 if(m>=l&d>1)goto C; /* abort on fail high */
\r
198 v=d-1?e:i-p; /*** MVV/LVA scoring if d=1**/
\r
199 if(d-!t>1) /*** all captures if d=2 ***/
\r
200 {v=gt=0;G: /* retry move with gating */
\r
201 v+=centr[p]?b[x+257]-b[y+257]:0; /* center positional pts. */
\r
202 if(!(G&S))b[FF]=b[G],v+=50; /* castling: put R & score */
\r
203 b[G]=b[H]=0;b[x]=gt;b[y]=u|32; /* do move, set non-virgin */
\r
204 i+=-((pl[t&31]-=!!t)&1)&pb[t&31];/* update piece count, pair bonus */
\r
205 v-=w[p]>0|R<EG?0:20; /*** freeze K in mid-game ***/
\r
206 if(p<3) /* pawns: */
\r
207 {v-=9*((x-2&M||b[x-2]-u)+ /* structure, undefended */
\r
208 (x+2&M||b[x+2]-u) /* squares plus bias */
\r
209 +(w[b[x^16]&15]<0)) /*** cling to magnetic K ***/
\r
210 +(R-76>>2); /* end-game Pawn-push bonus */
\r
211 b[y]+=V=y+r+1&S?647-p|pm:2*(u&y+16&32);/*upgrade P or convert to Q*/
\r
212 if(V&makruk)b[y]=u|7,V=480; /* Makruk promotion on 6th */
\r
213 V>>=sh; /* for Shatranj promo to F */
\r
214 i+=V; /* promotion / passer bonus */
\r
215 } if(z&S && GamePtr<6) v+=(rand()>>10&31)-16;
\r
216 J+=J(0);Z+=J(4)+G-S;
\r
217 pl[k]-=!!t; /* count pieces per side */
\r
218 v+=e+i;V=m>q?m:q; /*** new eval & alpha ****/
\r
219 if(z&S)V=m-margin>q?m-margin:q; /* multiPV */
\r
220 C=d-1-(d>5&p>2&!t&!h); /* nw depth, reduce non-cpt.*/
\r
221 C=R<EG|P-I|d<3||t&&p-3?C:d; /* extend 1 ply if in-check */
\r
223 s=C>2|v>V?-D(16-k,-l,-V,-v,/*** futility, recursive eval. of reply */
\r
225 W(s>q&++C<d); v=s; /* no fail:re-srch unreduced*/
\r
226 if(v>V&v<l){int *p=sp;
\r
231 if(z&S&&K-I) /* move pending: check legal*/
\r
232 {if(v+I&&x==K&y==L>==GT) /* if move found */
\r
233 {Q=-e-i;O=F;LL=L;prom=gt;
\r
234 if(b[y]-u&15)prom=b[y]-=PromPiece, /* under-promotion, correct */
\r
235 pl[u&31]--,pl[prom&31]++,Z+=PromPiece;/*piece & invalidate hash */
\r
236 a->D=99;a->V=0; /* lock game in hash as draw*/
\r
237 R-=i/FAC; /*** total captd material ***/
\r
238 Fifty = t|p<3?0:Fifty+1;
\r
240 return l;} /* & not in check, signal */
\r
241 v=m; /* (prevent fail-lows on */
\r
242 } /* K-capt. replies) */
\r
243 pl[k]+=!!t;pl[t&31]+=!!t;
\r
244 b[G]=b[FF];b[FF]=b[y]=0;b[x]=u;b[H]=t; /* undo move,G can be dummy */
\r
245 } /* if non-castling */
\r
246 if(z&S&&K==I&d>2&v>V&v<l){int *p=ps;char X,Y;
\r
248 printf("%2d ",d-2);
\r
250 printf("%8d %10d",(GetTickCount()-Ticks)/10,N);
\r
251 while(*p){X=*p>>8;Y=*p++;
\r
252 printf(" %c%c%c%c",'a'+(X&15),'8'-(X>>4),'a'+(Y&15),'8'-(Y>>4&7));}
\r
253 printf("\n");fflush(stdout);
\r
254 }GT=gt; /* In root, remember gated */
\r
256 if(v>m) /* new best, update max,best*/
\r
257 m=v,X=x,Y=y|S&F; /* mark non-double with S */
\r
258 if(gating&&!(u&32)&&p>2&&d-!t>1){ /* virgin non-Pawn: gate */
\r
259 pl[(gt|=k+40)-27]++; /* prev. gated back in hand */
\r
260 if(m>=l)goto C; /* loop skips cutoff :-( */
\r
261 W(++gt<k+43)if(pl[gt-27]){ /* look if more to gate */
\r
262 pl[gt-27]--;v=10;goto G; /* remove from hand & retry */
\r
265 if(h){h=0;goto A;} /* redo after doing old best*/
\r
267 s=t;v=r^flag>>12; /* calc. alternated vector */
\r
268 if(flag&15^4|u&32|| /* no double or moved before*/
\r
269 p>2&!(flag&S)&& /* no P & no virgin jump, */
\r
270 ((b[G=r<0?x&~15:BW-1|x&112]^32)<33 /* no virgin R in corner G, */
\r
271 ||b[G^1]|b[G^2]|b[FF=y+v-r]) /* no 2 empty sq. next to R */
\r
272 )t+=flag&4; /* fake capt. for nonsliding*/
\r
273 else if(flag&64)t=flag&128?0:t,flag&=63;else F=y; /* enable e.p. */
\r
274 if(s&&flag&8)t=0,flag^=flag>>4&15; /* hoppers go to next phase */
\r
275 if(!(flag&S)) /* zig-zag piece? */
\r
276 r=v,flag^=flag>>4&15; /* alternate vector & mode */
\r
277 }W(!t); /* if not capt. continue ray*/
\r
279 if((++x&15)>=BW)x=x+16&112; /* next sqr. of board, wrap */
\r
281 C:FMAX( m=m+I|P==I?m:(X=Y=0); ) /* if stalemate, draw-score */
\r
282 if(a->D<99) /* protect game history */
\r
283 a->K=Z,a->V=m,a->D=d,a->X=X, /* always store in hash tab */
\r
284 a->F=8*(m>q)|S*(m<l),a->Y=Y; /* move, type (bound/exact),*/
\r
285 } /* encoded in X S,8 bits */
\r
286 if(z&4*S)K=X,L=Y&~S;
\r
288 return m+=m<e; /* delayed-loss bonus */
\r
292 /* Generic main() for Winboard-compatible engine */
\r
293 /* (Inspired by TSCP) */
\r
294 /* Author: H.G. Muller */
\r
296 /* The engine is invoked through the following */
\r
297 /* subroutines, that can draw on the global vaiables */
\r
298 /* that are maintained by the interface: */
\r
299 /* Side side to move */
\r
300 /* Move move input to or output from engine */
\r
301 /* PromPiece requested piece on promotion move */
\r
302 /* TimeLeft ms left to next time control */
\r
303 /* MovesLeft nr of moves to play within TimeLeft */
\r
304 /* MaxDepth search-depth limit in ply */
\r
305 /* Post boolean to invite engine babble */
\r
307 /* InitEngine() progran start-up initialization */
\r
308 /* InitGame() initialization to start new game */
\r
309 /* (sets Side, but not time control) */
\r
310 /* Think() think up move from current position */
\r
311 /* (leaves move in Move, can be invalid */
\r
312 /* if position is check- or stalemate) */
\r
313 /* DoMove() perform the move in Move */
\r
314 /* (togglese Side) */
\r
315 /* ReadMove() convert input move to engine format */
\r
316 /* PrintMove() print Move on standard output */
\r
317 /* Legal() check Move for legality */
\r
318 /* ClearBoard() make board empty */
\r
319 /* PutPiece() put a piece on the board */
\r
321 /* define this to the codes used in your engine, */
\r
322 /* if the engine hasn't defined it already. */
\r
324 int PrintResult(int s)
\r
328 /* search last 50 states with this stm for third repeat */
\r
329 for(j=2; j<=100 && j <= HistPtr; j+=2)
\r
331 for(k=0; k<STATE; k++)
\r
332 if(HistoryBoards[HistPtr][k] !=
\r
333 HistoryBoards[HistPtr-j&1023][k] )
\r
336 /* is the same, count it */
\r
337 if(++cnt > 1) /* third repeat */
\r
339 printf("1/2-1/2 {Draw by repetition}\n");
\r
345 cnt = D(s,-I,I,Q,O,LL|4*S,3);
\r
347 if(pl[s]==1 && pl[16-s]==1) {
\r
348 printf("1/2-1/2 {Insufficient mating material}\n");
\r
351 if(pl[s]<=1 && pl[16-s]>1) {
\r
353 printf("0-1 {Bare King}\n");
\r
355 printf("1-0 {Bare King}\n");
\r
359 if(cnt>-I+1 && K==0 && L==0) {
\r
360 printf("1/2-1/2 {Stalemate}\n");
\r
366 printf("0-1 {Black mates}\n");
\r
368 if(succession) { // suppress loss claim if black might be able to replace its King by promotion
\r
369 for(j=0;j<BW;j++)if((b[j+96]&31)==18)return 0;
\r
371 printf("1-0 {White mates}\n");
\r
376 printf("1/2-1/2 {Draw by fifty move rule}\n");
\r
385 N=32*S+7;W(N-->S+3)T[N]=rand()>>9;
\r
386 srand(GetTickCount());
\r
393 Side = WHITE; Q=0; O=S;
\r
395 for(i=0;i<16*BH;i++)b[i]=0;
\r
396 for(i=0;i<32;i++)pl[i]=0;
\r
398 {b[K]=oo[K+16]+16;b[K+112]=oo[K];b[K+16+16*!!makruk]=18;b[K+96-16*!!makruk]=1; /* initial board setup*/
\r
399 pl[oo[K+16]+16]++;pl[oo[K]]++;pl[18]++;pl[1]++;
\r
400 if(w[oo[K+16]+16] == -1)pl[oo[K+16]+16]=1;
\r
401 if(w[oo[K]] == -1)pl[oo[K]]=1;
\r
402 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
403 } /*(in unused half b[])*/
\r
404 for(i=0; i<BW; i++) {
\r
405 R += abs(w[oo[i]])/FAC + abs(w[oo[i+16]])/FAC;
\r
406 Q += abs(w[oo[i]]) - abs(w[oo[i+16]]) + w[1] - w[2];
\r
407 Q += (pl[i]>>1)*pb[i] -(pl[i+16]>>1)*pb[i];
\r
408 if(w[oo[i]] < 0) k = w[oo[i]];
\r
411 pl[WHITE] = pl[BLACK] = 2*BW;
\r
412 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
413 if(gating) pl[14] = pl[15] = pl[30] = pl[31] = 1, R += 2*(w[9]/FAC + w[10]/FAC);
\r
416 void CopyBoard(int s)
\r
420 /* copy game representation of engine to HistoryBoard */
\r
421 /* don't forget castling rights and e.p. state! */
\r
422 for(i=0; i<BH; i++)
\r
423 for(j=0; j<BW; j++) /* board squares */
\r
424 HistoryBoards[s][BW*i+j] = b[16*i+j]|64*(16*i+j==O);
\r
427 void PrintVariants(int combo)
\r
429 int count=0, total=0; char c=EOF+1, buf[80];
\r
432 f = fopen(INI_FILE, "r");
\r
433 if(f==NULL) return;
\r
435 /* search for game names in definition file */
\r
437 while(fscanf(f, "Game: %s", buf) != 1 && c != EOF)
\r
438 while((c = fgetc(f)) != EOF && c != '\n');
\r
439 if(c == EOF) break;
\r
441 if(combo == (strstr(buf, "fairy/") != buf)) continue;
\r
442 if(combo && count == 0) strcpy(selectedFairy, buf);
\r
443 if(count++) printf(combo ? " /// " : ",");
\r
444 printf("%s", combo ? buf+6 : buf);
\r
448 if(!combo && total != count) printf("%sfairy", count ? "," : "");
\r
451 void PrintOptions()
\r
453 printf("feature option=\"Resign -check %d\"\n", Resign);
\r
454 printf("feature option=\"Resign Threshold -spin %d 200 1200\"\n", Threshold);
\r
455 printf("feature option=\"Ini File -file %s\"\n", inifile);
\r
456 printf("feature option=\"Multi-PV Margin -spin %d 0 1000\"\n", margin);
\r
457 printf("feature option=\"Variant fairy selects -combo "); PrintVariants(1); printf("\"\n");
\r
458 printf("feature option=\"Cambodian Makruk rules -check %d\"\n", Cambodian);
\r
459 printf("feature option=\"Dummy Slider Example -slider 20 0 100\"\n");
\r
460 printf("feature option=\"Dummy String Example -string happy birthday!\"\n");
\r
461 printf("feature option=\"Dummy Path Example -path .\"\n");
\r
462 printf("feature option=\"Clear Hash -button\"\n");
\r
463 printf("feature done=1\n");
\r
466 void LoadGame(char *name)
\r
468 int i, j, ptc, count=0; char c, buf[80], pieceToChar[80];
\r
469 static int currentVariant;
\r
472 f = fopen(inifile, "r");
\r
474 { printf("telluser piece-description file '%s' not found\n", inifile);
\r
477 if(fscanf(f, "version 4.8(%c)", &c)!=1 || c != 'w')
\r
478 { printf("telluser incompatible fmax.ini file\n"); exit(0); }
\r
480 gating = succession = 0;
\r
482 { /* search for game name in definition file */
\r
483 if(!strcmp(name, "makruk") && Cambodian) name = "cambodian"; else
\r
484 if(!strcmp(name, "fairy")) name = selectedFairy;
\r
485 gating = !strcmp(name, "seirawan");
\r
486 while((ptc=fscanf(f, "Game: %s # %s", buf, pieceToChar))==0 || strcmp(name, buf) ) {
\r
487 while((c = fgetc(f)) != EOF && c != '\n');
\r
490 printf("telluser variant %s not supported\n", name);
\r
492 return; /* keep old settings */
\r
495 currentVariant = count;
\r
498 /* We have found variant, or if none specified, are at beginning of file */
\r
499 if(fscanf(f, "%dx%d", &BW, &BH)!=2 || BW>12 || BH!=8)
\r
500 { printf("telluser unsupported board size %dx%d\n",BW,BH); exit(0); }
\r
502 for(i=0; i<BW; i++) fscanf(f, "%d", oo+i);
\r
503 for(i=0; i<BW; i++) fscanf(f, "%d", oo+i+16);
\r
504 for(i= 0; i<=U; i++)
\r
505 A[i].K = A[i].D = A[i].X = A[i].Y = A[i].F = 0; /* clear hash */
\r
506 for(i=0; i<32; i++) piecetype[i] = blacktype[i] = 0;
\r
509 while(fscanf(f, "%d,%x", o+j, of+j)==2 ||
\r
510 fscanf(f,"%c:%d",&c, w+i+1)==2)
\r
512 { od[++i]=j; centr[i] = c>='a';
\r
513 blacktype[c&31]=i; piecename[i]=c&31;
\r
514 if(piecetype[c&31]==0) piecetype[c&31]=i; // only first
\r
515 pb[i] = pb[i+16] = w[i]>>3 & ~3; // pair bonus, for now 1/8 of piece value, leave low bits for flag
\r
516 succession |= w[i] < -4; // expendable royalty; assume we can promote to it
\r
518 if((o[j]^o[j]+8>>4)&1 || of[j]>>4) pb[i] = pb[i+16] = 0; // not color bound (or too complex to see it), so no pair bonus
\r
519 if(!o[j]) pb[i] = pb[i+16] = of[j--]; // hand-set pair bonus kludges: 3 for mating minor, negative for non-mating pair.
\r
522 /* 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
523 c=0; if(i>15 || j>255) break;
\r
527 sh = w[7] < 250 ? 3 : 0;
\r
528 makruk = w[7]==181 ? 64 : 0; // w[7] is used as kludge to enable makruk promotions
\r
529 if(name == selectedFairy) {
\r
530 printf(ptc == 1 ? "setup " : "setup (%s) ", pieceToChar); // setup board in GUI
\r
531 for(i=0; i<BW; i++) printf("%c", piecename[oo[i+16]]+'`'); printf("/");
\r
532 for(i=0; i<BW; i++) printf("%c", piecename[2]+'`'); printf("/");
\r
533 for(i=2; i<BH-2; i++) printf("%d/", BW);
\r
534 for(i=0; i<BW; i++) printf("%c", piecename[1]+'@'); printf("/");
\r
535 for(i=0; i<BW; i++) printf("%c", piecename[oo[i]]+'@'); printf(" w KQkq - 0 1\n");
\r
539 int main(int argc, char **argv)
\r
541 int Computer, MaxTime, MaxMoves, TimeInc, sec, i;
\r
542 char line[256], command[256], c;
\r
546 if(argc>1 && sscanf(argv[1], "%d", &m)==1)
\r
547 { U = (1<<m)-1; argc--; argv++; }
\r
548 A = (struct _ *) calloc(U+1, sizeof(struct _));
\r
549 if(argc>1) inifile = argv[1];
\r
551 signal(SIGINT, SIG_IGN);
\r
552 printf("tellics say " NAME " " VERSION "\n");
\r
553 printf("tellics say by H.G. Muller\n");
\r
554 printf("tellics say Gothic Chess is protected by U.S. patent #6,481,716 by Ed Trice.\n");
\r
555 printf("tellics say Falcon Chess is protected by U.S. patent #5,690,334 by George W. Duke\n");
\r
560 MaxTime = 10000; /* 10 sec */
\r
561 MaxDepth = 30; /* maximum depth of your search */
\r
565 if (Side == Computer) {
\r
566 /* think up & do move, measure time used */
\r
567 /* it is the responsibility of the engine */
\r
568 /* to control its search time based on */
\r
569 /* MovesLeft, TimeLeft, MaxMoves, TimeInc */
\r
570 /* Next 'MovesLeft' moves have to be done */
\r
571 /* within TimeLeft+(MovesLeft-1)*TimeInc */
\r
572 /* If MovesLeft<0 all remaining moves of */
\r
573 /* the game have to be done in this time. */
\r
574 /* If MaxMoves=1 any leftover time is lost*/
\r
575 Ticks = GetTickCount();
\r
576 cpuT = CPUtime(); printf("# times @ %u\n", Ticks);
\r
577 m = MovesLeft<=0 ? 40 : MovesLeft;
\r
578 tlim = (0.6-0.06*(BW-8))*(TimeLeft+(m-1)*TimeInc)/(m+7);
\r
579 if(tlim>TimeLeft/15) tlim = TimeLeft/15;
\r
580 PromPiece = 0; /* Always promote to Queen ourselves */
\r
582 if (D(Side,-I,I,Q,O,LL|S,3)==I) {
\r
583 Side ^= BLACK^WHITE;
\r
584 m = GetTickCount() - Ticks;
\r
585 printf("# times @ %u: real=%d cpu=%1.0f\n", m + Ticks, m,
\r
586 (CPUtime() - cpuT)/CLOCKS_PER_SEC);
\r
588 printf("%c%c%c%c",'a'+(K&15),'0'+BH-(K>>4),
\r
589 'a'+(L&15),'0'+BH-(L>>4));
\r
590 if(prom)printf("%c",piecename[prom&15]+'a'-1);
\r
593 /* time-control accounting */
\r
595 TimeLeft += TimeInc;
\r
596 if(--MovesLeft == 0) {
\r
597 MovesLeft = MaxMoves;
\r
599 TimeLeft = MaxTime;
\r
600 else TimeLeft += MaxTime;
\r
603 GameHistory[GamePtr++] = PACK_MOVE;
\r
604 CopyBoard(HistPtr=HistPtr+1&1023);
\r
605 if(Resign && Score <= -Threshold) {
\r
606 printf("resign\n"); Computer=EMPTY;
\r
607 } else if(PrintResult(Side))
\r
610 if(!PrintResult(Side))
\r
611 printf("resign { refuses own move }\n");
\r
616 if (!fgets(line, 256, stdin))
\r
618 if (line[0] == '\n')
\r
620 sscanf(line, "%s", command);
\r
621 if (!strcmp(command, "xboard"))
\r
623 if (!strcmp(command, "protover")) {
\r
624 printf("feature myname=\"" NAME " " VERSION "\"\n");
\r
625 printf("feature memory=1\n");
\r
626 printf("feature setboard=0 xedit=1 ping=1 done=0\n");
\r
627 printf("feature variants=\"");
\r
633 if (!strcmp(command, "ping")) { int nr=0;
\r
634 sscanf(line, "ping %d", &nr);
\r
635 printf("pong %d\n", nr);
\r
638 if (!strcmp(command, "p")) {
\r
642 if (!strcmp(command, "memory")) {
\r
644 sscanf(line+6, "%d", &mem); mem = (mem*1024*1024)/12; // max nr of hash entries
\r
645 mask = 0x7FFFFFFF; while(mask > mem) mask >>= 1;
\r
648 A = (struct _ *) calloc(U+1, sizeof(struct _));
\r
652 if (!strcmp(command, "new")) {
\r
653 /* start new game */
\r
654 LoadGame("normal");
\r
656 GamePtr = Setup = 0;
\r
660 TimeLeft = MaxTime;
\r
661 MovesLeft = MaxMoves;
\r
662 for(nr=0; nr<1024; nr++)
\r
663 for(m=0; m<STATE; m++)
\r
664 HistoryBoards[nr][m] = 0;
\r
667 if (!strcmp(command, "quit"))
\r
670 if (!strcmp(command, "force")) {
\r
671 /* computer plays neither */
\r
675 if (!strcmp(command, "white")) {
\r
676 /* set white to move in current position */
\r
677 if(Side == BLACK) Q = -Q;
\r
682 if (!strcmp(command, "black")) {
\r
683 /* set blck to move in current position */
\r
684 if(Side == WHITE) Q = -Q;
\r
689 if (!strcmp(command, "st")) {
\r
690 /* move-on-the-bell mode */
\r
691 /* indicated by MaxMoves = 1 */
\r
692 sscanf(line, "st %d", &MaxTime);
\r
693 MovesLeft = MaxMoves = 1;
\r
694 TimeLeft = MaxTime *= 1000;
\r
698 if (!strcmp(command, "sd")) {
\r
699 /* set depth limit (remains in force */
\r
700 /* until next 'sd n' command) */
\r
701 sscanf(line, "sd %d", &MaxDepth);
\r
702 MaxDepth += 2; /* QS depth */
\r
705 if (!strcmp(command, "level")) {
\r
706 /* normal or blitz time control */
\r
708 if(sscanf(line, "level %d %d %d",
\r
709 &MaxMoves, &MaxTime, &TimeInc)!=3 &&
\r
710 sscanf(line, "level %d %d:%d %d",
\r
711 &MaxMoves, &MaxTime, &sec, &TimeInc)!=4)
\r
713 MovesLeft = MaxMoves;
\r
714 TimeLeft = MaxTime = 60000*MaxTime + 1000*sec;
\r
718 if (!strcmp(command, "time")) {
\r
719 /* set time left on clock */
\r
720 sscanf(line, "time %d", &TimeLeft);
\r
721 TimeLeft *= 10; /* centi-sec to ms */
\r
724 if (!strcmp(command, "otim")) {
\r
725 /* opponent's time (not kept, so ignore) */
\r
728 if (!strcmp(command, "easy")) {
\r
731 if (!strcmp(command, "hard")) {
\r
734 if (!strcmp(command, "accepted")) {
\r
737 if (!strcmp(command, "rejected")) {
\r
740 if (!strcmp(command, "random")) {
\r
743 if (!strcmp(command, "option")) {
\r
744 int i; static char filename[80];
\r
745 if(sscanf(line+7, "Resign=%d", &Resign) == 1) continue;
\r
746 if(sscanf(line+7, "Resign Threshold=%d", &Threshold) == 1) continue;
\r
747 if(sscanf(line+7, "Ini File=%s", filename) == 1) {
\r
748 inifile = filename; continue;
\r
750 if(sscanf(line+7, "Clear Hash%c", &c) == 1) for(i=0; i<=U; i++) A->K = 0;
\r
751 if(sscanf(line+7, "MultiVariation Margin=%d", &margin) == 1) continue;
\r
752 if(sscanf(line+7, "Variant fairy selects=%s", selectedFairy+6) == 1) continue;
\r
753 if(sscanf(line+7, "Cambodian Makruk rules=%d", &Cambodian) == 1) continue;
\r
756 if (!strcmp(command, "go")) {
\r
757 /* set computer to play current side to move */
\r
759 MovesLeft = -(GamePtr+(Side==WHITE)>>1);
\r
760 while(MaxMoves>0 && MovesLeft<=0)
\r
761 MovesLeft += MaxMoves;
\r
764 if (!strcmp(command, "hint")) {
\r
765 Ticks = GetTickCount(); tlim = 1000;
\r
766 D(Side,-I,I,Q,O,LL|4*S,6);
\r
770 printf("%c%c%c%c",'a'+(K&7),'8'-(K>>4),
\r
771 'a'+(L&7),'8'-(L>>4));
\r
775 if (!strcmp(command, "undo") && (nr=1) ||
\r
776 !strcmp(command, "remove") && (nr=2) ) {
\r
777 /* 'take back' moves by replaying game */
\r
778 /* from history until desired ply */
\r
779 if (GamePtr - nr < 0)
\r
782 HistPtr -= nr; /* erase history boards */
\r
784 for(m=0; m<STATE; m++)
\r
785 HistoryBoards[HistPtr+nr+1&1023][m] = 0;
\r
788 for(i=0; i<128; i++) b[i] = setupPosition[i];
\r
789 for(i=0; i<32; i++) pl[i] = setupPosition[i+130];
\r
790 Side = setupPosition[128]; Q = SetupQ;
\r
791 R = setupPosition[129];
\r
793 for(i=0; i<=U; i++) A[i].D = A[i].K = 0; // clear hash table
\r
794 for(nr=0; nr<GamePtr; nr++) {
\r
795 UNPACK_MOVE(GameHistory[nr]);
\r
796 D(Side,-I,I,Q,O,LL|S,3);
\r
797 Side ^= BLACK^WHITE;
\r
801 if (!strcmp(command, "post")) {
\r
805 if (!strcmp(command, "nopost")) {
\r
809 if (!strcmp(command, "variant")) {
\r
810 sscanf(line, "variant %s", command);
\r
812 InitGame(); Setup = 0;
\r
815 if (!strcmp(command, "edit")) {
\r
816 int color = WHITE, p, r;
\r
818 while(fgets(line, 256, stdin)) {
\r
822 for(i=0; i<128; i++) b[i]=0;
\r
823 for(i=0; i<32; i++) pl[i]=0;
\r
825 pl[WHITE]=pl[BLACK]=0;
\r
829 color = WHITE+BLACK - color;
\r
833 if( m >= 'A' && m <= 'Z' && piecetype[m&31]) {
\r
834 p = (color == WHITE ? piecetype : blacktype)[line[0]&31];
\r
835 if(line[1] == '@') { // stuff holdings
\r
836 pl[color+p+5] = m = line[2] - '0';
\r
837 pl[BLACK+WHITE-color]+=m;pl[p+color]+=m;
\r
838 Q+=m*w[p]; R+=m*(w[p]/FAC);
\r
841 if(line[1] >= 'a' && line[1] <= 'a'+BW-1
\r
842 && line[2] >= '1' && line[2] <= '0'+BH) {
\r
843 m = line[1]-16*line[2]+799; r = m & 0x70;
\r
849 b[m]=r==0x10?161:r==0x20?97:r==0x60?1:33,
\r
850 Q+=w[1]+(r==0x10?S:r==0x20?64:0);
\r
851 else b[m]=r==0x60?178:r==0x50?114:r==0x10?18:50,
\r
852 Q+=w[2]+(r==0x60?S:r==0x50?64:0);
\r
855 b[m]=p+color+32; // assume non-virgin
\r
856 if(color==BLACK && m<0x10 && p==oo[m+16] || // but make virgin on original square
\r
857 color==WHITE && m>0x6F && p==oo[m-0x70]) b[m] -= 32;
\r
858 if(w[p]<0) { // Royal piece on original square: virgin
\r
859 Q-=w[p]; // assume value was flipped to indicate royalty
\r
860 if(pl[p+color])R-=w[p]/FAC; // capturable King, add to material
\r
861 } else { Q+=w[p]; R+=w[p]/FAC; }
\r
862 case 0: // undefined piece, ignore
\r
865 pl[BLACK+WHITE-color]++; if(pl[p+color]++&1) Q+=pb[p];
\r
866 if(w[p+color] == -1)pl[p+color]=1; // fake we have one if value = -1, to thwart extinction condition
\r
871 if(Side != color) Q = -Q;
\r
872 GamePtr = HistPtr = 0; Setup = 1; SetupQ = Q; // start anew
\r
873 for(i=0; i<128; i++) setupPosition[i] = b[i]; // remember position
\r
874 setupPosition[128] = Side;
\r
875 setupPosition[129] = R;
\r
876 for(i=0; i<32; i++) setupPosition[i+130] = pl[i];
\r
877 Computer = EMPTY; // after edit: force mode!
\r
880 /* command not recognized, assume input move */
\r
881 m = line[0]<'a' | line[0]>='a'+BW | line[1]<'1' | line[1]>='1'+BH |
\r
882 line[2]<'a' | line[2]>='a'+BW | line[3]<'1' | line[3]>='1'+BH;
\r
883 if(line[4] == '\n') line[4] = 0;
\r
884 GT = (Side == WHITE ? piecetype : blacktype)[line[4]&31];
\r
885 if(GT) PromPiece = (Side == WHITE ? 7 : 7+pm) - GT, GT |= 32 + Side;
\r
886 {char *c=line; K=c[0]-16*c[1]+799;L=c[2]-16*c[3]+799; }
\r
887 if(w[GT&15] == -1) L = S; // spoil move for promotion to King
\r
888 if (m & line[1] != '@')
\r
889 /* doesn't have move syntax */
\r
890 printf("Error (unknown command): %s\n", command);
\r
892 if(b[L] && (b[L]&16) == Side && w[b[L]&15] < 0) // capture own King: castling
\r
893 { i=K; K = L; L = i>L ? i-1 : i+2; }
\r
894 if((b[K]&15) < 3) GT = 0; // Pawn => true promotion rather than gating
\r
895 if(D(Side,-I,I,Q,O,LL|S,3)!=I) {
\r
896 /* did have move syntax, but illegal move */
\r
897 printf("Illegal move:%s\n", line);
\r
898 } else { /* legal move, perform it */
\r
899 if(i >= 0) b[i]=b[K],b[K]=0; // reverse Seirawan gating
\r
900 GameHistory[GamePtr++] = PACK_MOVE;
\r
901 Side ^= BLACK^WHITE;
\r
902 CopyBoard(HistPtr=HistPtr+1&1023);
\r
903 if(PrintResult(Side)) Computer = EMPTY;
\r