kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 00:33:09 +00:00
Code Issues Releases Wiki Activity

IncrementalFutilityMargin to 4 and increased pruning

Browse source 
Increase pruning at low depths while tone downa bit at
higher depths (linearize a bit the logaritmic behaviour)

This goes togheter with IncrementalFutilityMargin decreased
to 4 compensate the bigger pruning effect.

Total pruned nodes are more or less the same. We go from 36%
of nodes after prune to 37% with this patch.

After 999 games at 1+0
Mod vs Orig +250 =526 -223 +9 ELO

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2009-11-26 11:37:21 +01:00
parent 1a7047f544
commit af3dd21e90
1 changed files with 10 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/search.cpp
View file

@ -180,7 +180,7 @@ namespace {
const Value FutilityMarginQS = Value(0x80); const Value FutilityMarginQS = Value(0x80);
// Each move futility margin is decreased // Each move futility margin is decreased
const Value IncrementalFutilityMargin = Value(0x8); const Value IncrementalFutilityMargin = Value(0x4);
// Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply
const Value FutilityMargins[12] = { Value(0x100), Value(0x120), Value(0x200), Value(0x220), Value(0x250), Value(0x270), const Value FutilityMargins[12] = { Value(0x100), Value(0x120), Value(0x200), Value(0x220), Value(0x250), Value(0x270),
@ -1452,6 +1452,12 @@ namespace {
// Move count pruning limit // Move count pruning limit
const int MCLimit = 3 + (1 << (3*int(depth)/8)); const int MCLimit = 3 + (1 << (3*int(depth)/8));
/*
for (int d = 2; d < 16; d++)
std::cout << d << " -> " << 56*(0+2*bitScanReverse32(1 * int(d) * int(d) / 2)) << std::endl;
//std::cout << d << " -> " << 32*(1+3*bitScanReverse32(1 * int(d) * int(d))) << std::endl;
*/
// Loop through all legal moves until no moves remain or a beta cutoff occurs // Loop through all legal moves until no moves remain or a beta cutoff occurs
while ( bestValue < beta while ( bestValue < beta
&& (move = mp.get_next_move()) != MOVE_NONE && (move = mp.get_next_move()) != MOVE_NONE
@ -1513,10 +1519,10 @@ namespace {
// Value based pruning // Value based pruning
if (approximateEval < beta) if (approximateEval < beta)
{ {//dbg_before();
if (futilityValue == VALUE_NONE) if (futilityValue == VALUE_NONE)
futilityValue = evaluate(pos, ei, threadID) futilityValue = evaluate(pos, ei, threadID)
+ 64*(2+bitScanReverse32(int(depth) * int(depth))); + 56*(0+2*bitScanReverse32(1 * int(depth) * int(depth) / 2));
futilityValueScaled = futilityValue - moveCount * IncrementalFutilityMargin; futilityValueScaled = futilityValue - moveCount * IncrementalFutilityMargin;
@ -1526,6 +1532,7 @@ namespace {
bestValue = futilityValueScaled; bestValue = futilityValueScaled;
continue; continue;
} }
//dbg_after(); // 36% (inc == 8), 40% (inc == 4), 37%(56)
} }
} }