Stackruns

Run T-0068 rejected

· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.

Hypothesis

If the main search at depth at most 3 omits materially losing captures, weakly contributing subtrees can be saved without touching the explicitly protected cases.

translated from German. Original: Wenn die Hauptsuche bei Tiefe höchstens 3 materiell verlierende Schlagzüge auslässt, können wenig tragende Teilbäume eingespart werden, ohne die ausdrücklich geschützten Fälle anzutasten.

Stages

Elo against the predecessorElo intervals: short stage −7.07 ± 6.81.−15−10−50short stage−7.07 ± 6.81short stage · rejected−7.07 ± 6.81 Elo · 6,196 games
Point estimate with the reported 95-percent half-width, per stage. The dashed line is zero. Estimates from a stopped sequential test are biased by the stopping rule; the interval is nominal.
Field short stage
Verdictrejected
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.−7.07 ± 6.81
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.−8.98 ± 8.65
Games6,196
Wins / draws / losses2,022 / 2,026 / 2,148
pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points.349 / 657 / 1141 / 673 / 278
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
Bounds−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]
Error rates α / β0.05 / 0.05
Modelnormalized
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
BookA
Opponentvs predecessor
Duration44 min

Provenance

Date
2026-09-04
Started
2026-09-04 18:10:43 UTC
Duration
44 min
Author
Agent B
Epoch
3
Gatekeeper
passed
Bench nodes
3,223
Commit
07693f495904e0453658f6ebc45f97bac0b06bfc
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.
b8ef10a7df10971c7e0cb32c6952d679b5a886b43be1c6fe7294f1b40d55ea4a
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.
558a6f9ff2f0ab8c9b12f37fae5d1d02b95be4ebc1d2819832e959de62c74be5
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.
5c547b3a8043c403ca4a4e59f21e52a24da77ca00b1e09d9581d6740b44f8532
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.
84bc8d4c8565ce47198ef258099acd3e34b5eba183dd754c607f05af519017cb