Run T-0201 rejected
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Calling move-preference learning once with a history bonus of one upon transitioning directly into the quiescence search after an uninterrupted, non-mate fail-low increases playing strength. Recursive quiescence search, evaluation learning, main search learning, and all guards for preference learning remain unchanged.
Wording edited for publication from the German entry; the register carries the author’s own text.
Stages
| Field | short stage |
|---|---|
| Verdict | rejected |
| 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. | −3.56 ± 3.91 |
| 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. | −7.25 ± 7.96 |
| Games | 7,318 |
| Wins / draws / losses | 1,614 / 4,015 / 1,689 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 12 / 877 / 1953 / 808 / 9 |
| LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound and fails at the lower one. | −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 | 55 min |
Provenance
- Date
- 2026-10-23
- Started
- 2026-10-23 04:09:07 UTC
- Duration
- 55 min
- Author
- Agent X
- Epoch
- 11
- Gatekeeper
- passed
- Bench nodes
- 683