From 7cc61e2603d50ff9451eec6cecd57cfe3fc403cf Mon Sep 17 00:00:00 2001 From: Fabian Fichter Date: Sun, 2 Sep 2018 16:55:12 +0200 Subject: [PATCH] Less early pruning for nCheck variants STC 3check LLR: 2.95 (-2.94,2.94) [0.00,10.00] Total: 4562 W: 2177 L: 2017 D: 368 http://35.161.250.236:6543/tests/view/5b8bfa486e23db0fbab0dd37 --- src/search.cpp | 3 ++- 1 files changed, 2 insertions(+), 1 deletions(-) diff --git a/src/search.cpp b/src/search.cpp index d984956..dd15427 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -723,6 +723,7 @@ namespace { // Step 7. Razoring (~2 Elo) if ( !PvNode && depth < 3 * ONE_PLY + && !pos.max_check_count() && eval <= alpha - RazorMargin[depth / ONE_PLY]) { Value ralpha = alpha - (depth >= 2 * ONE_PLY) * RazorMargin[depth / ONE_PLY]; @@ -741,7 +742,7 @@ namespace { // Step 8. Futility pruning: child node (~30 Elo) if ( !rootNode && depth < 7 * ONE_PLY - && eval - futility_margin(depth, improving) >= beta + && eval - futility_margin(depth, improving) * (1 + !!pos.max_check_count()) >= beta && eval < VALUE_KNOWN_WIN) // Do not return unproven wins return eval; -- 1.7.0.4