1
0
Fork 0

Don't do InCheck Pruning at the root of QS

STC:
LLR: 2.96 (-2.94,2.94) [0.00,5.00]
Total: 34603 W: 6441 L: 6167 D: 21995

LTC:
LLR: 2.97 (-2.94,2.94) [0.00,5.00]
Total: 24474 W: 3274 L: 3076 D: 18124

Bench: 5934421

Closes #1089
pull/1093/head
VoyagerOne 2017-04-28 20:40:01 -07:00 committed by Joona Kiiski
parent b948b037a5
commit a18c2c2c3f
1 changed files with 2 additions and 1 deletions

View File

@ -879,7 +879,7 @@ moves_loop: // When in check search starts from here
// (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
// is singular and should be extended. To verify this we do a reduced search
// on all the other moves but the ttMove and if the result is lower than
// ttValue minus a margin then we extend the ttMove.
// ttValue minus a margin then we will extend the ttMove.
if ( singularExtensionNode
&& move == ttMove
&& pos.legal(move))
@ -1283,6 +1283,7 @@ moves_loop: // When in check search starts from here
// Detect non-capture evasions that are candidates to be pruned
evasionPrunable = InCheck
&& depth != DEPTH_ZERO
&& bestValue > VALUE_MATED_IN_MAX_PLY
&& !pos.capture(move);