X-Git-Url: http://winboard.nl/cgi-bin?a=blobdiff_plain;f=hachu.c;h=503d06165426f3015d3fe5761ff5d7af984f7153;hb=ffaca03a425220a0ed043bb48ee2a94b86aab60b;hp=ec89af4cb0e18bd1c437f3ee8439921a814fe120;hpb=a6e527af5886ee2be168cf87cccc2ade770a5247;p=hachu.git diff --git a/hachu.c b/hachu.c index ec89af4..503d061 100644 --- a/hachu.c +++ b/hachu.c @@ -10,9 +10,9 @@ // promotions by pieces with Lion power stepping in & out the zone in same turn // promotion on capture -#define VERSION "0.18" +#define VERSION "0.19" -//define PATH level==0 || path[0] == 0x1103a && (level==1 || path[1] == 0x6f0f6 && (level == 2 /*|| path[2] == 0x8710f && (level == 3 /*|| path[3] == 0x3e865 && (level == 4 || path[4] == 0x4b865 && (level == 5)))*/)) +//define PATH level==0 || path[0] == 0x590cb && (level==1 || path[1] == 0x4c0c9 && (level == 2 || path[2] == 0x8598ca && (level == 3 /*|| path[3] == 0x3e865 && (level == 4 || path[4] == 0x4b865 && (level == 5))*/))) #define PATH 0 #define HASH @@ -24,8 +24,9 @@ #define XWINGS #define KINGSAFETY #define KSHIELD -#define XFORTRESS +#define FORTRESS #define PAWNBLOCK +#define TANDEM 100 /* bonus for pairs of attacking light steppers */ #define KYLIN 100 /* extra end-game value of Kylin for promotability */ #define PROMO 0 /* extra bonus for 'vertical' piece when it actually promotes (diagonal pieces get half) */ @@ -117,7 +118,8 @@ #define PST_RETRACT (5*BW*BH+BH) #define PST_WFLYER (6*BW*BH) #define PST_BFLYER (6*BW*BH+BH) -#define PST_END (7*BW*BH) +#define PST_LANCE (7*BW*BH) +#define PST_END (8*BW*BH) typedef unsigned int Move; @@ -164,7 +166,7 @@ int retMSP, retFirst, retDep, pvPtr, level, cnt50, mobilityScore; int ll, lr, ul, ur; // corner squares int nodes, startTime, lastRootMove, lastRootIter, tlim1, tlim2, tlim3, repCnt, comp, abortFlag; Move ponderMove; -Move retMove, moveStack[10000], path[100], repStack[300], pv[1000], repeatMove[300], killer[100][2]; +Move retMove, moveStack[20000], path[100], repStack[300], pv[1000], repeatMove[300], killer[100][2]; int maxDepth; // used by search @@ -735,7 +737,7 @@ Range (signed char *r) int i, m=0; for(i=0; i<8; i++) { int d = r[i]; - if(r[i] < 0) d == r[i] >= L ? 2 : 36; + if(r[i] < 0) d = r[i] >= L ? 2 : 36; if(d > m) m = d; } return m; @@ -800,7 +802,7 @@ AddPiece (int stm, PieceDesc *list) p[i].bulk = list->bulk; p[i].mobWeight = v > 600 ? 0 : v >= 400 ? 1 : v >= 300 ? 2 : v > 150 ? 3 : v >= 100 ? 2 : 0; if(Lance(list->range)) - p[i].mobWeight = 5 + 3*(list->range[4]==X), p[i].pst = 0; // clear path but don't move forward + p[i].mobWeight = 0, p[i].pst = list->range[4] ? PST_NEUTRAL : PST_LANCE; // keep back for(j=stm+2; j<= last[stm]; j+=2) { if(p[j].promo >= i) p[j].promo += 2; } @@ -818,6 +820,7 @@ SetUp(char *array, int var) char c, *q, name[3], prince = 0; PieceDesc *p1, *p2; last[WHITE] = 1; last[BLACK] = 0; + royal[WHITE] = royal[BLACK] = 0; for(i=0; ; i++) { //printf("next rank: %s\n", array); for(j = BW*i; ; j++) { @@ -858,6 +861,9 @@ SetUp(char *array, int var) } } eos: + // add dummy Kings if not yet added (needed to set royal[] to valid value!) + if(!royal[WHITE]) p[AddPiece(WHITE, LookUp("K", V_CHU))].pos = ABSENT; + if(!royal[BLACK]) p[AddPiece(BLACK, LookUp("K", V_CHU))].pos = ABSENT; // add dummy Crown Princes if not yet added if(!(prince & WHITE+1)) p[AddPiece(WHITE, LookUp("CP", V_CHU))].pos = ABSENT; if(!(prince & BLACK+1)) p[AddPiece(BLACK, LookUp("CP", V_CHU))].pos = ABSENT; @@ -874,10 +880,10 @@ SetUp(char *array, int var) if(i == kylin[WHITE]) p[i].promoGain = 1.25*KYLIN, p[i].value += KYLIN; // if(j > 0 && p[i].pst == PST_STEPPER) p[i].pst = PST_WPPROM; // use white pre-prom bonus if(j > 0 && p[i].pst == PST_STEPPER && p[i].value >= 100) - p[i].pst = p[i].value <= 150 ? PST_ADVANCE : PST_NEUTRAL; // light steppers advance + p[i].pst = p[i].value <= 150 ? PST_ADVANCE : PST_WPPROM; // light steppers advance if(j > 0 && p[i].bulk == 6) p[i].pst = PST_WFLYER, p[i].mobWeight = 4; // SM defends zone if((j = p[i].promo) > 0 && g) - p[i].promoGain = (p[j].value - p[i].value - g)*1.25, p[i].value = p[j].value - g; + p[i].promoGain = (p[j].value - p[i].value - g)*0.9, p[i].value = p[j].value - g; else p[i].promoGain = 0; board[p[i].pos] = i; rootEval += p[i].value + PST[p[i].pst + p[i].pos]; @@ -888,11 +894,11 @@ SetUp(char *array, int var) int g = p[i].promoGain; // if(j > 0 && p[i].pst == PST_STEPPER) p[i].pst = PST_BPPROM; // use black pre-prom bonus if(j > 0 && p[i].pst == PST_STEPPER && p[i].value >= 100) - p[i].pst = p[i].value <= 150 ? PST_RETRACT : PST_NEUTRAL; // light steppers advance + p[i].pst = p[i].value <= 150 ? PST_RETRACT : PST_BPPROM; // light steppers advance if(j > 0 && p[i].pst == PST_WJUMPER) p[i].pst = PST_BJUMPER; // use black pre-prom bonus if(j > 0 && p[i].bulk == 6) p[i].pst = PST_BFLYER, p[i].mobWeight = 4; // SM defends zone if((j = p[i].promo) > 0 && g) - p[i].promoGain = (p[j].value - p[i].value - g)*1.25, p[i].value = p[j].value - g; + p[i].promoGain = (p[j].value - p[i].value - g)*0.9, p[i].value = p[j].value - g; else p[i].promoGain = 0; if(i == kylin[BLACK]) p[i].promoGain = 1.25*KYLIN, p[i].value += KYLIN; board[p[i].pos] = i; @@ -989,17 +995,23 @@ Init (int var) PST[PST_STEPPER+s] = d/4 - (i < 2 || i > BH-3 ? 3 : 0) - (j == 0 || j == BH-1 ? 5 : 0) + 3*(i==zone || i==BH-zone-1); // stepper centralization PST[PST_WJUMPER+s] = d/6; // double-stepper centralization - PST[PST_SLIDER +s] = d/12 - 7*(i==BH/2 || i==(BH-1)/2); // slider centralization + PST[PST_SLIDER +s] = d/12 - 15*(i==BH/2 || i==(BH-1)/2);// slider centralization PST[PST_TRAP +s] = j < 3 || j > BH-4 ? (i < 3 ? 7 : i == 3 ? 4 : i == 4 ? 2 : 0) : 0; PST[PST_CENTER+s] = ((BH-1)*(BH-1) - (2*i - BH + 1)*(2*i - BH + 1) - (2*j - BH + 1)*(2*j - BH + 1))/6; PST[PST_WPPROM+s] = PST[PST_BPPROM+s] = PST[PST_STEPPER+s]; // as stepper, but with pre-promotion bonus W/B PST[PST_BJUMPER+s] = PST[PST_WJUMPER+s]; // as jumper, but with pre-promotion bonus B PST[PST_ZONDIST+s] = BW*(zone - 1 - i); // board step to enter promo zone black PST[PST_ADVANCE+s] = PST[PST_WFLYER-s-1] = 2*(5*i+i*i) - (i >= zone)*6*(i-zone+1)*(i-zone+1) - - 50 - 20*(j==0 || j == BH-1) - 10*(j == 1 || BH-2); // advance-encouraging table - PST[PST_WFLYER +s] = PST[PST_END-s-1] = (i == zone-1)*40 + (i == zone-2)*20 - 20; + - (2*j - BH + 1)*(2*j - BH + 1)/BH + BH/2 + - 50 - 35*(j==0 || j == BH-1) - 15*(j == 1 || BH-2); // advance-encouraging table + PST[PST_WFLYER +s] = PST[PST_LANCE-s-1] = (i == zone-1)*40 + (i == zone-2)*20 - 20; + PST[PST_LANCE +s] = (PST[PST_STEPPER+j] - PST[PST_STEPPER+s])/2; } if(zone > 0) PST[PST_WPPROM+BW*(BH-1-zone) + j] += 10, PST[PST_BPPROM + BW*zone + j] += 10; + if(j > (BH-1)/2 - 3 && j < BH/2 + 3) + PST[PST_WPPROM + j] += 4, PST[PST_BPPROM + BW*(BH-1) + j] += 4; // fortress + if(j > (BH-1)/2 - 2 && j < BH/2 + 2) + PST[PST_WPPROM + BW + j] += 2, PST[PST_BPPROM + BW*(BH-2) + j] += 2; // fortress #if KYLIN // pre-promotion bonuses for jumpers if(zone > 0) PST[PST_WJUMPER + BW*(BH-2-zone) + j] = PST[PST_BJUMPER + BW*(zone+1) + j] = 100, @@ -1556,10 +1568,27 @@ Guard (int sqr) int Fortress (int forward, int king, int lion) { // penalty for lack of Lion-proof fortress - int rank = PST[king], anchor, r, l, q; - if(!rank) return -300; + int rank = PST[king], anchor, r, l, q, res = 0; + if(rank != 2) return 25*(rank-2); anchor = king + forward*(rank-1); + q = Guard(anchor); l = Guard(anchor-1); r = Guard(anchor+1); + if(!q) return l > 1 || r > 1 ? 0 : -25; + if(q == 1) res = 40*(l > 1 && r > 1); // TGT, EGT or TGE get 40 + else { // T or E in front of King + if(l > 1) res = 30 + (r > 1)*(20 + 5*(q==2)); // TT., ET. or TE. (30), TET (50), TTE (55) + else if(r > 1) res = 30; // .TT, .ET or .TE (30) + } + q = 0; + if(filling > 32) { + if(r > 1 && Guard(king+2) == 1) q += 10; + if(l > 1 && Guard(king-2) == 1) q += 10; + q += 5*(Guard(king+1) == 1); + q += 5*(Guard(king-1) == 1); + if(filling < 96) q = q*(filling - 32)>>6; + } + return res + q; + if(Guard(anchor) == 3 || Guard(anchor+1) == 3 || Guard(anchor-1) == 3) return 0; if(rank == 2 && Guard(king+1) == 3 || Guard(king-1) == 3) return -50; if(Guard(r=anchor) == 2 || Guard(r=anchor+1) == 2 || Guard(r=anchor-1) == 2) @@ -1588,7 +1617,7 @@ Fortress (int forward, int king, int lion) } int -Surround (int stm, int king, int start) +Surround (int stm, int king, int start, int max) { int i, s=0; for(i=start; i<9; i++) { @@ -1598,7 +1627,7 @@ Surround (int stm, int king, int start) v = p[piece].value; s += -(v > 70) & v; } - return (s > 512 ? 512 : s); + return (s > max ? max : s); } int @@ -1614,7 +1643,9 @@ Ftest (int side) int Evaluate (int difEval) { - int wLion = ABSENT, bLion = ABSENT, wKing, bKing, score=mobilityScore, f, i, j; + int wLion = ABSENT, bLion = ABSENT, wKing, bKing, score=mobilityScore, f, i, j, max=512; + + if(tsume) return difEval; if(p[WHITE+2].value == LVAL) wLion = p[WHITE+2].pos; if(p[BLACK+2].value == LVAL) bLion = p[BLACK+2].pos; @@ -1656,17 +1687,18 @@ Evaluate (int difEval) score += (PST[PST_CENTER+wKing] - PST[PST_CENTER+bKing])*(32 - filling) >> 7; if(lead > 100) score -= PST[PST_CENTER+bKing]*(32 - filling) >> 3; // white leads, drive black K to corner if(lead < -100) score += PST[PST_CENTER+wKing]*(32 - filling) >> 3; // black leads, drive white K to corner + max = 16*filling; } # ifdef FORTRESS f = 0; if(bLion != ABSENT) f += Fortress( BW, wKing, bLion); if(wLion != ABSENT) f -= Fortress(-BW, bKing, wLion); - score += (filling < 96 ? f : f*(224 - filling) >> 7); // build up slowly + score += (filling < 192 ? f : f*(224 - filling) >> 5); // build up slowly # endif # ifdef KSHIELD - score += Surround(WHITE, wKing, 1) - Surround(BLACK, bKing, 1) >> 3; + score += Surround(WHITE, wKing, 1, max) - Surround(BLACK, bKing, 1, max) >> 3; # endif #endif @@ -1678,17 +1710,17 @@ Evaluate (int difEval) int sq; if((wLion = kylin[WHITE]) && (sq = p[wLion].pos) != ABSENT) { int anchor = sq - PST[5*BW*BH - 1 - sq]; // FIXME: PST_ZONDIST indexed backwards - score += (512 - Surround(BLACK, anchor, 0))*(128 - filling)*PST[p[wLion].pst + sq] >> 15; + score += (512 - Surround(BLACK, anchor, 0, 512))*(128 - filling)*PST[p[wLion].pst + sq] >> 15; } if((bLion = kylin[BLACK]) && (sq = p[bLion].pos) != ABSENT) { int anchor = sq + PST[PST_ZONDIST + sq]; - score -= (512 - Surround(WHITE, anchor, 0))*(128 - filling)*PST[p[bLion].pst + sq] >> 15; + score -= (512 - Surround(WHITE, anchor, 0, 512))*(128 - filling)*PST[p[bLion].pst + sq] >> 15; } } #endif #ifdef PAWNBLOCK - // penalty for blocking own P or GB: 20 by slider, 10 by other, but 50 if only retreat mode is straight back + // penalty for blocking own P or GB: 20 by slider, 10 by other, but 50 if only RETRACT mode is straight back for(i=last[WHITE]; i > 1 && p[i].value<=50; i-=2) { if((f = p[i].pos) != ABSENT) { // P present, if((j = board[f + BW])&1) // square before it white (odd) piece @@ -1707,7 +1739,26 @@ Evaluate (int difEval) } #endif - return difEval - (filling*filling*promoDelta >> 16) + (stm ? score : -score); +#ifdef TANDEM + if(zone > 0) { + int rw = BW*(BH-1-zone), rb = BW*zone, h=0; + for(f=0; f 0) h += (p[board[rw+f-BW-1]].pst == PST_ADVANCE); + if(f+1 < BH) h += (p[board[rw+f-BW+1]].pst == PST_ADVANCE); + } + if(p[board[rb+f]].pst == PST_ADVANCE) { + h -= (p[board[rb+f+BW]].pst == PST_RETRACT); + if(f > 0) h -= (p[board[rb+f+BW-1]].pst == PST_RETRACT); + if(f+1 < BH) h -= (p[board[rb+f+BW+1]].pst == PST_RETRACT); + } + } + score += h*TANDEM; + } +#endif + + return difEval - (filling*promoDelta >> 8) + (stm ? score : -score); } inline void @@ -1742,8 +1793,15 @@ if(PATH) /*pboard(board),pmap(attacks, BLACK),*/printf("search(%d) {%d,%d} eval= // in-check test and TSUME filter { k = p[king=royal[stm]].pos; - if( k == ABSENT) k = p[king + 2].pos; - else if(p[king + 2].pos != ABSENT) k = ABSENT; // two kings is no king... + if( k == ABSENT) { + if((k = p[king + 2].pos) == ABSENT && (!tsume || tsume & stm+1)) + return -INF; // lose when no King (in tsume only for side to be mated) + } else if(p[king + 2].pos != ABSENT) { + if(tsume && tsume & stm+1) { + retDep = 60; return INF; // we win when not in check + } + k = ABSENT; // two kings is no king... + } if( k != ABSENT) { // check is possible if(!attacks[2*k + xstm]) { if(tsume && tsume & stm+1) { @@ -1765,7 +1823,7 @@ if(!level) {for(i=0; i<5; i++)printf("# %d %08x, %d\n", i, repStack[200-i], chec } } else { // he has no king! Test for attacks on Crown Prince k = p[king + 2].pos; - if(k == ABSENT || attacks[2*k + stm]) return INF; // we have attack on Crown Prince + if(k == ABSENT ? !tsume : attacks[2*k + stm]) return INF; // we have attack on Crown Prince } //printf("King safe\n");fflush(stdout); // EVALUATION & WINDOW SHIFT @@ -1860,7 +1918,11 @@ if(PATH) printf("%d:%2d:%2d next victim %d/%d\n",level,depth,iterDep,curMove,msp if(to == ABSENT) continue; // ignore if absent if(!attacks[2*to + stm]) continue; // skip if not attacked group = p[nextVictim].value; // remember value of this found victim - if(iterDep <= QSdepth + 1 && 2*group + curEval + 30 < alpha) { resDep = QSdepth + 1; goto cutoff; } + if(iterDep <= QSdepth + 1 && 2*group + curEval + 30 < alpha) { + resDep = QSdepth + 1; nextVictim -= 2; + if(bestScore < 2*group + curEval + 30) bestScore = 2*group + curEval + 30; + goto cutoff; + } if(PATH) printf("%d:%2d:%2d group=%d, to=%c%d\n",level,depth,iterDep,group,to%BW+'a',to/BW+ONE); GenCapts(to, 0); if(PATH) printf("%d:%2d:%2d first=%d msp=%d\n",level,depth,iterDep,firstMove,msp); @@ -1901,6 +1963,7 @@ if(PATH) printf("# autofail end (%d-%d)\n", firstMove, msp); case 6: // non-captures nonCapts = msp; nullMove = GenNonCapts(oldPromo); + if(msp == nonCapts) goto cutoff; #ifdef KILLERS { // swap killers to front Move h = killer[level][0]; int j = curMove; @@ -1964,6 +2027,7 @@ if(flag & depth >= 0) printf("%2d:%d found %d/%d %08x %s\n", depth, iterDep, cur if(flag & depth >= 0) printf("%2d:%d made %d/%d %s\n", depth, iterDep, curMove, msp, MoveToText(moveStack[curMove], 0)); for(i=2; i<=cnt50; i+=2) if(repStack[level-i+200] == hashKeyH) { + retDep = iterDep; if(repDraws) { score = 0; goto repetition; } if(!allowRep) { moveStack[curMove] = 0; // erase forbidden move @@ -2005,6 +2069,7 @@ MapFromScratch(attacks); // for as long as incremental update does not work. score = -Search(-beta, -iterAlpha, -difEval - tb.booty, iterDep-1+ext, curMove >= late && iterDep > QSdepth + LMR, promoSuppress & ~PROMOTE, defer, depth ? INF : tb.gain); + #else score = 0; #endif @@ -2082,7 +2147,7 @@ if(PATH) printf("%d:%2d:%d %3d %6x %-10s %6d %6d (%d)\n", level, depth, iterDep #ifdef HASH // hash store hashTable[index].lock[hit] = hashKeyH; - hashTable[index].depth[hit] = iterDep; + hashTable[index].depth[hit] = resDep; hashTable[index].score[hit] = bestScore; hashTable[index].flag[hit] = (bestScore < beta) * H_UPPER; if(bestScore > alpha) { @@ -2174,7 +2239,7 @@ pmoves(int start, int end) // some parameter of your engine #define MAXMOVES 2000 /* maximum game length */ - #define MAXPLY 30 /* maximum search depth */ + #define MAXPLY 60 /* maximum search depth */ #define OFF 0 #define ON 1 @@ -2268,6 +2333,7 @@ Convert (char *fen) *p++ = table[2* (*fen - 'A' - n)+1] + n; } } else *p++ = *fen; + if(!*fen) break; fen++; } printf("# converted FEN '%s'\n", fenArray); @@ -2288,7 +2354,7 @@ Setup2 (char *fen) SetUp(array, currentVariant); strcpy(startPos, array); sup0 = sup1 = sup2 = ABSENT; - hashKeyH = hashKeyL = 87620895*currentVariant; + hashKeyH = hashKeyL = 87620895*currentVariant + !!fen; return stm; }