Run T-0033 passed

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

Hypothesis

Incrementally cached king squares should improve playing strength by eliminating repeated board scans from check detection while preserving the search tree.

Predecessor set to: T-0033

Stages

Elo against the predecessorElo intervals: short stage +10.82 ± 5.83.0+5+10+15short stage+10.82 ± 5.83short stage · passed+10.82 ± 5.83 Elo · 4,238 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 stagelong stage
Verdictpassedpassed
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.+10.82 ± 5.83+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.+19.45 ± 10.46+3,829.68 ± 30.83
Games4,238488
Wins / draws / losses1,522 / 1,326 / 1,390487 / 0 / 1
pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points.80 / 244 / 1369 / 316 / 1100 / 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.050.05 / 0.05
Modelnormalizednormalized
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.0840+0.4
BookAB
Opponentvs predecessorvs reference v0
Duration30 min9 min

Provenance

Date
2026-08-29
Started
2026-08-29 18:04:47 UTC
Duration
39 min
Author
Agent B
Bench nodes
3,786
Commit
46758a35d8be82639cae03aaecdbc2ff793e4dcf
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.
4f8f01c62268dd6d84ed407452abd89bd08cdf5a4ff73a3ec503c778701719af