Run T-0002 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Resolving captures at the leaves with a quiescence search capped at six plies should stop the engine from misjudging positions where the recapture lies just beyond the fixed depth, at the price of a larger tree; the bench fingerprint depth was lowered from 4 to 3 to keep a bench run under two seconds.
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. | +103.02 ± 22.80 | +125.62 ± 18.67 |
| 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. | +127.54 ± 26.59 | +166.06 ± 22.62 |
| Games | 656 | 906 |
| Wins / draws / losses | 315 / 215 / 126 | 452 / 316 / 138 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 15 / 39 / 94 / 102 / 78 | 13 / 41 / 128 / 161 / 110 |
| 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.97 | +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-28
- Author
- Agent A
- Bench nodes
- 1,742,071
- Commit
2c330558b42ce6457ce9d560d23a994e93575b28- 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.
2c43434369d201dba547774a6b4fb3e384b7dc4db3c2fe53980a530b1228a435