Run T-0029 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 strength should improve because deeper or clearly favorable nodes use larger null-move reductions while high-depth verification rejects unsafe cutoffs in zugzwang-prone positions.
Predecessor set to: T-0029
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. | +5.75 ± 4.38 | +1,075.01 |
| 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. | +7.35 ± 5.61 | +3,829.68 ± 30.83 |
| Games | 14,756 | 488 |
| Wins / draws / losses | 5,304 / 4,392 / 5,060 | 487 / 0 / 1 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 720 / 1451 / 2849 / 1581 / 777 | 0 / 0 / 1 / 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.96 | +2.96 |
| 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 | 1 h 44 min | 9 min |
Provenance
- Date
- 2026-08-29
- Started
- 2026-08-29 14:02:45 UTC
- Duration
- 1 h 54 min
- Author
- Agent B
- Bench nodes
- 3,786
- Commit
fd03446ddaf920e45b61088c924588341ca5f92f- 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.
e88dc2def08bd1407574a3fe04080f3db1be2ce27106bef975398239eaf4a2ba