Update Elo estimates for terms in search.

[BM123499]

This updates estimates from 2yr ago #2401, and adds missing terms.
All tests run at 10+0.1 (STC), 20000 games, error bars +- 1.8 Elo, book 8moves_v3.png.

Test	Estimative (Elo)
If ttMove is quiet, update move sorting heuristics on TT hit	+0.80
Bonus for a quiet ttMove that fails high	+2.66
Extra penalty for early quiet moves of the previous ply	-0.52
Penalty for a quiet ttMove that fails low	+1.08
Can ttValue be used as a better position evaluation (search)	+4.13
Use static evaluation difference to improve quiet move ordering	+2.88
Futility pruning: child node	+24.55
Null move search with verification search	+22.00
If not in TT, decrease depth by 2 or 1	+2.50
A small Probcut idea, when we are in check	-0.28
Pruning at shallow depth	+98.63
FutilityMoveCount	+6.91
Futility pruning for captures	+0.42
SEE based pruning	+9.10
Continuation history based pruning	+1.7
Futility pruning: parent node	+8.71
Prune moves with negative SEE	+3.25
Extensions	+65.85
Singular extension	+57.82
Check extensions	+0.94
Quiet ttMove extensions	-1.20
LMR	+98.20
Can ttValue be used as a better position evaluation (qsearch)	+6.85
Futility pruning and moveCount pruning	+4.95
Do not search moves with negative SEE values	+5.14
Continuation history based pruning	+2.05

Values are rounded to the nearest non-negative integer.

Non-red tests that have been tried simplification and failed:
If ttMove is quiet, update move sorting heuristics on TT hit
Extra penalty for early quiet moves of the previous ply
Penalty for a quiet ttMove that fails low
A small Probcut idea, when we are in check
Check extensions

Simplification found by these tests:
#3863
#3867

Test about pure NNUE vs Hybrid:
LTC: https://tests.stockfishchess.org/tests/view/61b5785cdffbe89a3580948a (~10 Elo)
STC: https://tests.stockfishchess.org/tests/view/61b5784ddffbe89a35809484 ( ~7 Elo)

No functional change.