mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 05:07:46 +00:00
Revert VLTC regression from #5634
https://tests.stockfishchess.org/tests/view/671bf61b86d5ee47d953cf23 And thanks to @xu-shawn for suggesting running a VLTC regress test since depth modifications affect scaling. Also, the LTC was showing a slight regress after 680+k games ~= -0.34 , for reference: https://tests.stockfishchess.org/tests/view/67042b1f86d5ee47d953be7c closes https://github.com/official-stockfish/Stockfish/pull/5663 Bench: 1307308
This commit is contained in:
+1
-1
@@ -850,7 +850,7 @@ Value Search::Worker::search(
|
|||||||
// For cutNodes, if depth is high enough, decrease depth by 2 if there is no ttMove,
|
// For cutNodes, if depth is high enough, decrease depth by 2 if there is no ttMove,
|
||||||
// or by 1 if there is a ttMove with an upper bound.
|
// or by 1 if there is a ttMove with an upper bound.
|
||||||
if (cutNode && depth >= 7 && (!ttData.move || ttData.bound == BOUND_UPPER))
|
if (cutNode && depth >= 7 && (!ttData.move || ttData.bound == BOUND_UPPER))
|
||||||
depth -= 2;
|
depth -= 1 + !ttData.move;
|
||||||
|
|
||||||
// Step 11. ProbCut (~10 Elo)
|
// Step 11. ProbCut (~10 Elo)
|
||||||
// If we have a good enough capture (or queen promotion) and a reduced search
|
// If we have a good enough capture (or queen promotion) and a reduced search
|
||||||
|
|||||||
Reference in New Issue
Block a user