Merge pull request #8 from bctboi23/Pruning-improvement

More agressive search parameters

Author: bctboi23

bin/CeeChess-v1.3.1.exe bin/CeeChess-v1.3.2.exebin/CeeChess-v1.3.1.exe renamed to bin/CeeChess-v1.3.2.exe

@@ -1,2 +1,2 @@
 all:
-	gcc xboard.c CeeChess.c uci.c evaluate.c eval.h pvtable.c init.c bitboards.c hashkeys.c board.c data.c attack.c io.c movegen.c validate.c makemove.c perft.c search.c misc.c -o CeeChess-v1.3.1.exe -O3 -s
+	gcc xboard.c CeeChess.c uci.c evaluate.c eval.h pvtable.c init.c bitboards.c hashkeys.c board.c data.c attack.c io.c movegen.c validate.c makemove.c perft.c search.c misc.c -o CeeChess-v1.3.2.exe -O3 -s

bin/CeeChess-v1.3.exe

@@ -17,19 +17,19 @@ static const int FutilityDepth = 6;
 static const int FutilityMargin[7] = {0, 200, 325, 450, 575, 700, 825};
 
 // Reverse Futility Values
-static const int RevFutilityDepth = 4;
-static const int RevFutilityMargin[5] = {0, 250, 500, 750, 1000};
+static const int RevFutilityDepth = 5;
+static const int RevFutilityMargin[6] = {0, 200, 400, 600, 800, 1000};
 
 // LMR Values
 static const int LateMoveDepth = 3;
-static const int FullSearchMoves = 4;
+static const int FullSearchMoves = 2;
 int LMRTable[64][64];
 
 void InitSearch() {
 	// creating the LMR table entries (idea from Ethereal)
 	for (int moveDepth = 1; moveDepth < 64; moveDepth++)
   	for (int played = 1; played < 64; played++)
-      LMRTable[moveDepth][played] = 1 + (log(moveDepth) * log(played) / 1.7);
+      LMRTable[moveDepth][played] = 1 + (log(moveDepth) * log(played) / 1.75);
 }
 
 static void CheckUp(S_SEARCHINFO *info) {