Berserk 8.5.1

jhonnold · Jan 3, 2022 · e0923bd · e0923bd
1 parent 9bb3845
commit e0923bd
Show file tree

Hide file tree

Showing 3 changed files with 7 additions and 7 deletions.
diff --git a/src/makefile b/src/makefile
@@ -1,7 +1,7 @@
 CC = gcc
 SRC = *.c pyrrhic/tbprobe.c noobprobe/noobprobe.c
 EXE = berserk
-VERSION = 8.5
+VERSION = 8.5.1
 EVALFILE = default.nn
 
 DEFS = -DVERSION=\"$(VERSION)\" -DEVALFILE=\"$(EVALFILE)\" -DNDEBUG

diff --git a/src/search.c b/src/search.c
@@ -238,7 +238,7 @@ void* Search(void* arg) {
       if (!mainThread || depth < 5 || !params->timeset) continue;
 
       int sameBestMove = results->bestMoves[depth] == results->bestMoves[depth - 1];  // same move?
-      searchStability = sameBestMove ? min(10, searchStability + 1) : 0;     // increase how stable our best move is
+      searchStability = sameBestMove ? min(10, searchStability + 1) : 0;  // increase how stable our best move is
       double stabilityFactor = 1.25 - 0.05 * searchStability;
 
       double scoreDiff = results->scores[depth - 3] - results->scores[depth];
@@ -489,8 +489,8 @@ int Negamax(int alpha, int beta, int depth, int cutnode, ThreadData* thread, PV*
     playedMoves++;
 
     if (isRoot && !thread->idx && GetTimeMS() - params->start > 2500)
-      printf("info depth %d multipv %d currmove %s currmovenumber %d\n", thread->depth, thread->multiPV + 1,
-             MoveToStr(move, board), playedMoves + thread->multiPV);
+      printf("info depth %d currmove %s currmovenumber %d\n", thread->depth, MoveToStr(move, board),
+             playedMoves + thread->multiPV);
 
     if (!tactical)
       quiets[numQuiets++] = move;

diff --git a/src/types.h b/src/types.h
@@ -104,9 +104,9 @@ typedef struct {
 
   int contempt[2];
 
-  Move skipMove[MAX_SEARCH_PLY];  // moves to skip during singular search
-  int evals[MAX_SEARCH_PLY];      // static evals at ply stack
-  Move searchMoves[MAX_SEARCH_PLY + 2];     // moves for ply stack
+  Move skipMove[MAX_SEARCH_PLY];         // moves to skip during singular search
+  int evals[MAX_SEARCH_PLY];             // static evals at ply stack
+  Move searchMoves[MAX_SEARCH_PLY + 2];  // moves for ply stack
 
   Move killers[MAX_SEARCH_PLY][2];  // killer moves, 2 per ply
   Move counters[64 * 64];           // counter move butterfly table