#include <string.h>
#include <time.h>
#include <stdlib.h>
+#include <math.h>
#include "common.h"
#include "backend.h"
};
char *promote_pieces=" nbrqac=";
-extern char castlingRights[][BOARD_SIZE];
-extern char epStatus[];
uint64 Random64[781] = {
U64(0x9D39247E33776D41), U64(0x2AF7398005AAA5C7), U64(0x44DB015024623547), U64(0x9C15F73E62A76AE2),
}
// Holdings not implemented yet!
- if(castlingRights[moveNr][2] >= 0) {
- if(castlingRights[moveNr][0] >= 0) key^=RandomCastle[0];
- if(castlingRights[moveNr][1] >= 0) key^=RandomCastle[1];
+ if(boards[moveNr][CASTLING][2] != NoRights) {
+ if(boards[moveNr][CASTLING][0] != NoRights) key^=RandomCastle[0];
+ if(boards[moveNr][CASTLING][1] != NoRights) key^=RandomCastle[1];
}
- if(castlingRights[moveNr][5] >= 0) {
- if(castlingRights[moveNr][3] >= 0) key^=RandomCastle[2];
- if(castlingRights[moveNr][4] >= 0) key^=RandomCastle[3];
+ if(boards[moveNr][CASTLING][5] != NoRights) {
+ if(boards[moveNr][CASTLING][3] != NoRights) key^=RandomCastle[2];
+ if(boards[moveNr][CASTLING][4] != NoRights) key^=RandomCastle[3];
}
- f = epStatus[moveNr];
+ f = boards[moveNr][EP_STATUS];
if(f >= 0 && f < 8){
if(!WhiteOnMove(moveNr)){
// the test for neighboring Pawns might not be needed,
// correct FRC-style castlings in variant normal.
// [HGM] This is buggy code! e1h1 could very well be a normal R or Q move.
if(!strcmp(move_s,"e1h1")){
- strcpy(move_s,"e1g1");
+ safeStrCpy(move_s,"e1g1", 6);
}else if(!strcmp(move_s,"e1a1")){
- strcpy(move_s,"e1c1");
+ safeStrCpy(move_s,"e1c1", 6);
}else if(!strcmp(move_s,"e8h8")){
- strcpy(move_s,"e8g8");
+ safeStrCpy(move_s,"e8g8", 6);
}else if(!strcmp(move_s,"e8a8")){
- strcpy(move_s,"e8c8");
+ safeStrCpy(move_s,"e8c8", 6);
}
}
static char move_s[6];
int total_weight;
- if(book == NULL) return NULL;
+ if(book == NULL || moveNr >= 2*appData.bookDepth) return NULL;
// if(gameInfo.variant != VariantNormal) return NULL; // Zobrist scheme only works for normal Chess, so far
f=fopen(book,"rb");
if(!f){
if(appData.debugMode) fprintf(debugFP, "book key = %08x%08x\n", (unsigned int)(key>>32), (unsigned int)key);
offset=find_key(f, key, &entry);
- if(entry.key != key) return NULL;
+ if(entry.key != key) {
+ fclose(f);
+ return NULL;
+ }
entries[0] = entry;
count=1;
fseek(f, 16*(offset+1), SEEK_SET);
if(count == MOVE_BUF) break;
entries[count++] = entry;
}
+ if(appData.bookStrength != 50) { // transform weights
+ double power = 0, maxWeight = 0.0;
+ if(appData.bookStrength) power = (100.-appData.bookStrength)/appData.bookStrength;
+ for(i=0; i<count; i++) if(entries[i].weight > maxWeight) maxWeight = entries[i].weight;
+ for(i=0; i<count; i++){
+ double weight = entries[i].weight / maxWeight;
+ if(weight > 0)
+ entries[i].weight = appData.bookStrength || weight == 1.0 ? 1e4*exp(power * log(weight)) + 0.5 : 0.0;
+ }
+ }
total_weight = 0;
for(i=0; i<count; i++){
total_weight += entries[i].weight;
}
- j = (random() & 0x7FFF) * total_weight >> 15; // create random < total_weight
+ j = (random() & 0xFFF) * total_weight >> 12; // create random < total_weight
total_weight = 0;
for(i=0; i<count; i++){
total_weight += entries[i].weight;
move_to_string(move_s, entries[i].move);
if(appData.debugMode) fprintf(debugFP, "book move field = %d\n", entries[i].move);
+ fclose(f);
return move_s;
}