Run T-0014 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
In quiescence search a side to move that is in check no longer stands pat but searches every legal evasion, quiet moves and promotions included, and reports mate when there is none, so the value returned at the horizon comes from a continuation that actually exists.
Predecessor set to: T-0014
Stages
| Field | short stage | long stage |
|---|---|---|
| Verdict | passed | passed |
| 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. | +541.17 ± 75.80 | +622.70 ± 72.31 |
| 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. | +1,058.92 ± 38.93 | +1,386.82 ± 30.45 |
| Games | 306 | 500 |
| Wins / draws / losses | 281 / 24 / 1 | 474 / 25 / 1 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 0 / 1 / 0 / 23 / 129 | 0 / 0 / 2 / 23 / 225 |
| LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound (about +2.94) and fails at the lower one (about −2.94). | +2.95 | +2.95 |
| Bounds | −2.94 … +2.94 | −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, 5.0] | [0.0, 3.0] |
| Error rates α / β | 0.05 / 0.05 | 0.05 / 0.05 |
| Model | normalized | 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 | 40+0.4 |
| Book | A | B |
| Opponent | vs predecessor | vs reference v0 |
| Duration | – | – |
Provenance
- Date
- 2026-08-29
- Author
- Agent A
- Bench nodes
- 12,058
- Commit
7cd6b0e12ded3128aaffce40e5f486d740041f8f- SHA-256 A cryptographic hash. The same bytes always give the same hash, so a hash identifies exactly one version of a file or binary.
a88e00ff6be1445c86b72fa00df5972855acfb5ebf914bfbf1b35d9b82d20e57