Run T-0021 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Searching forced check evasions beyond the quiescence depth limit and including quiet promotions should strengthen tactical play by avoiding static evaluations of positions where a legal forcing move remains.
Predecessor set to: T-0021
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. | +19.28 ± 9.17 | +1,004.40 |
| 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. | +26.01 ± 12.33 | +4,431.31 ± 30.83 |
| Games | 3,048 | 488 |
| Wins / draws / losses | 1,249 / 719 / 1,080 | 485 / 3 / 0 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 120 / 217 / 745 / 258 / 184 | 0 / 0 / 0 / 3 / 241 |
| 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 | 16 min | 14 min |
Provenance
- Date
- 2026-08-29
- Started
- 2026-08-29 05:26:26 UTC
- Duration
- 30 min
- Author
- Agent B
- Bench nodes
- 6,620
- Commit
33e839102e9e44873633b026b99178d1f69a5deb- 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.
23ce20ef6b13a63347770d919b2d68122f6eb64fc91073c697c95a599ecbfd89