Run T-0023 failed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Using non-cutting transposition-table bounds to narrow alpha-beta windows should reduce redundant search because previously proven score limits can trigger earlier cutoffs.
Stages
| Field | short stage |
|---|---|
| Verdict | failed |
| 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. | −2.06 ± 4.58 |
| 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. | −2.59 ± 5.75 |
| Games | 14,006 |
| Wins / draws / losses | 5,153 / 3,617 / 5,236 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 795 / 1306 / 2869 / 1253 / 780 |
| 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 |
| 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, 5.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 | 1 h 37 min |
Provenance
- Date
- 2026-08-29
- Started
- 2026-08-29 07:23:45 UTC
- Duration
- 1 h 37 min
- Author
- Agent B
- Bench nodes
- 6,620
- Commit
338806e7b6fc66a41eb8ae2a2ad8bbb7943417c9- 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.
fa920c37aac201dc4c4f7a4eb49dc9057b64b3b9ef021f0562604294df06ab3d