{
int r, f, p_enc, squareNr, pieceGroup;
uint64 key=0, holdingsKey=0, Zobrist;
+ VariantClass v = gameInfo.variant;
+
+ switch(v) {
+ case VariantNormal:
+ case VariantFischeRandom: // compatible with normal
+ case VariantNoCastle:
+ case VariantXiangqi: // for historic reasons; does never collide anyway because of other King type
+ break;
+ case VariantGiveaway: // in opening same as suicide
+ key += VariantSuicide;
+ break;
+ case VariantGothic: // these are special cases of CRC, and can share book
+ case VariantCapablanca:
+ v = VariantCapaRandom;
+ default:
+ key += v; // variant type incorporated in key to allow mixed books without collisions
+ }
for(f=0; f<BOARD_WIDTH; f++){
for(r=0; r<BOARD_HEIGHT;r++){
int GetBookMoves(int moveNr, char *book, entry_t entries[])
{ // retrieve all entries for given position from book in 'entries', return number.
- FILE *f;
+ static FILE *f = NULL;
+ static char curBook[MSG_SIZ];
entry_t entry;
int offset;
uint64 key;
if(book == NULL || moveNr >= 2*appData.bookDepth) return -1;
// if(gameInfo.variant != VariantNormal) return -1; // Zobrist scheme only works for normal Chess, so far
- f=fopen(book,"rb");
+ if(!f || strcmp(book, curBook)){ // keep book file open until book changed
+ strncpy(curBook, book, MSG_SIZ);
+ if(f) fclose(f);
+ f = fopen(book,"rb");
+ }
if(!f){
DisplayError("Polyglot book not valid", 0);
appData.usePolyglotBook = FALSE;
offset=find_key(f, key, &entry);
if(entry.key != key) {
- fclose(f);
return FALSE;
}
entries[0] = entry;
if(count == MOVE_BUF) break;
entries[count++] = entry;
}
- fclose(f);
return count;
}
if(count != currentCount) {
do {
for(i=0; i<len1; i++) buf2[i] = buf1[i]; len2 = len1;
- fseek(f, readpos, SEEK_SET);
- readpos += len1 = fread(buf1, 1, 4096, f);
+ if(readpos > writepos) {
+ fseek(f, readpos, SEEK_SET);
+ readpos += len1 = fread(buf1, 1, 4096, f);
+ } else len1 = 0; // wrote already past old EOF
fseek(f, writepos, SEEK_SET);
fwrite(buf2, 1, len2, f);
writepos += len2;