Run T-0110 rejected
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
A per-search correction history of static eval, keyed by side to move and pawn structure hash, learns from informative node results and adjusts static_eval by up to 256 cp for pruning decisions in negamax, while the transposition table keeps the raw evaluation. This remeasures the idea because the earlier test evaluated an HCE engine, whereas the current engine is pure neural network.
Wording edited for publication from the German entry; the register carries the author’s own text.
Stages
| Field | short stage |
|---|---|
| Verdict | rejected |
| Elo Strength difference to the opponent, estimated from the games, with a 95-percent half-width where the oracle reported one. Never an absolute rating. | −3.02 ± 7.22 |
| nElo Normalised Elo: the Elo difference divided by the spread of the game results, so that the SPRT bounds mean the same at different time controls. | −4.70 ± 11.23 |
| Games | 3,676 |
| Wins / draws / losses | 967 / 1,710 / 999 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 76 / 469 / 783 / 431 / 79 |
| LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound and fails at the lower one. | −2.95 |
| Bounds | −2.94 … +2.94 |
| SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops. | [0.0, 10.0] |
| Error rates α / β | 0.05 / 0.05 |
| Model | normalized |
| time control Base time plus increment per move in seconds, e.g. 8+0.08: eight seconds per game plus 0.08 seconds per move. | 8+0.08 |
| Book | A |
| Opponent | vs predecessor |
| Duration | 28 min |
Provenance
- Date
- 2026-09-22
- Started
- 2026-09-22 12:09:44 UTC
- Duration
- 28 min
- Author
- Agent X
- Epoch
- 5
- Gatekeeper
- passed
- Bench nodes
- 3,627