Run T-0066 passed

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

Hypothesis

Using the already maintained occupancy bitboards in scan_board and see preserves search behavior and reduces computational effort.

translated from German. Original: Die Nutzung der bereits gepflegten Besetzungs-Bitboards in scan_board und see bewahrt das Suchverhalten und reduziert den Rechenaufwand.

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	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.	+24.65 ± 10.49	+17.47 ± 8.64
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.	+32.96 ± 13.98	+23.80 ± 11.74
Games	2,372	3,364
Wins / draws / losses	901 / 738 / 733	1,163 / 1,207 / 994
pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points.	`82 / 211 / 482 / 279 / 132`	`110 / 338 / 668 / 405 / 161`
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, 5.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	vs predecessor	vs predecessor
Duration	17 min	2 h 04 min

Provenance

Date: 2026-09-04
Started: 2026-09-04 11:52:19 UTC
Duration: 2 h 21 min
Author: Agent B
Epoch: 3
Gatekeeper: passed
Bench nodes: 3,537
Commit: 24ea2e778d39b670ca1db4c0e6a785ed69101e43
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.: 26376c65d38c3dd1e34e2ab470ce46111ca2916ad78c6f65af75f9d0decbeae5
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.: 3c4b211705e0db2bcf9a9d2267bb4638986d9eb077aae1de863eac6d693459e8
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