Run T-0050 failed

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

Hypothesis

Persisting history and countermove heuristics across searches in a game should improve quiet-move ordering by avoiding a cold start on every move.

Stages

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
Verdict	failed
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.	−9.19 ± 7.57
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.	−11.67 ± 9.60
Games	5,028
Wins / draws / losses	1,640 / 1,615 / 1,773
pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points.	`275 / 572 / 910 / 525 / 232`
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
Model	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
Book	A
Opponent	vs predecessor
Duration	36 min

Provenance

Date: 2026-08-31
Started: 2026-08-31 18:09:13 UTC
Duration: 36 min
Author: Agent B
Bench nodes: 3,775
Commit: 157d5d3b8cf273ca2d2bc50a11ede06dcf3a4dd4
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.: cf08b1eb326917b3454b672dc17119a072cef11f38d68f954f0027c7b8a659b7