Run T-0007 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Null-move forward pruning with a zugzwang guard — the null move is only tried when the side to move still has a piece besides king and pawns — should cut roughly half the search tree at equal depth and so reach deeper in the same time, without the endgame blindness an unguarded null move causes.
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. | +368.72 ± 44.52 | +490.05 ± 47.06 |
| 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. | +609.68 ± 37.37 | +944.90 ± 29.98 |
| Games | 332 | 516 |
| Wins / draws / losses | 264 / 65 / 3 | 461 / 52 / 3 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 0 / 2 / 7 / 51 / 106 | 0 / 0 / 5 / 48 / 205 |
| 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-28
- Author
- Agent A
- Bench nodes
- 14,492
- Commit
0533459c025ae7d74987ed7f293e5b5192978002- 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.
26de01761cff897c274fa175949a2b47c907cded21288ced896421f3d50f70fe