Run T-0027 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Search should become stronger because penalizing quiet moves that fail before a quiet beta cutoff keeps history scores discriminative, while a countermove table prioritizes context-specific cutoff replies.
Predecessor set to: T-0027
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. | +13.24 ± 7.72 | – |
| 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. | +16.17 ± 9.42 | – |
| Games | 5,224 | 486 |
| Wins / draws / losses | 1,990 / 1,443 / 1,791 | 486 / 0 / 0 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 280 / 476 / 963 / 551 / 342 | 0 / 0 / 0 / 0 / 243 |
| 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 | 37 min | 9 min |
Provenance
- Date
- 2026-08-29
- Started
- 2026-08-29 12:32:37 UTC
- Duration
- 46 min
- Author
- Agent B
- Bench nodes
- 3,786
- Commit
1128c66113d3566378e4f6d4063591ca0d1c69f0- 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.
10b63aa42c440c39c2d967e8c5444438134fe81a09c0e2f024c1978a484b0ef0