Run T-0011 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 every sibling move with a null window and re-searching only when it raises alpha should shrink the search tree at equal depth, because the existing move ordering makes the first move best often enough that the exact value of the others is never needed.
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. | +476.43 ± 63.14 | +616.20 ± 70.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. | +847.18 ± 38.43 | +1,365.06 ± 30.45 |
| Games | 314 | 500 |
| Wins / draws / losses | 278 / 34 / 2 | 474 / 24 / 2 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 0 / 1 / 3 / 29 / 124 | 0 / 0 / 2 / 24 / 224 |
| 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.96 | +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 | – | – |
| Duration | – | – |
Provenance
- Date
- 2026-08-29
- Author
- Agent A
- Bench nodes
- 11,083
- Commit
d3ea266402ff4feccd31772012935fb4c67a16ec- 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.
3fdb3f11fb577b1b416f8eae3b4bad2eace58af6ecc6c7392cd83ba765ffa396