Reports · 2026-09-19
Search does not separate from the network on the small checkpoint
Update-equivalence search against the network alone on the small checkpoint
| Row | Value | Low | High | n |
|---|---|---|---|---|
| search 200x10 | 0.208 | -0.016 | 0.433 | 24 |
| search 200x10, beta 0 | 0.083 | -0.027 | 0.194 | 24 |
| null pair | 0.015 | -0.054 | 0.084 | 200 |
Every game here is a game the checkpoint itself decides to draw. The network against itself on 200 paired games drew 159 of 200 into the quiet limit, so most seeds in every cell contribute a zero contrast (9 of 12 in the search cell, 10 of 12 in the ablation, 72 of 100 in the null pair), and a cell that wins every decisive game still moves its interval by only so much. That is the honest reading of the 60.4%: the search side won all five games of its cell that ended in a flag capture, and 12 seeds cannot lift an interval clear of zero against a 79.5% draw rate. The 1,000-rollout depth-40 cell, which the paper's Table 17 has at the top of its budget ladder, stays registered and unrun: one search move at that budget costs 8.4 s on this machine (measured on a middlegame probe under shared load), about 90 hours for its 100 paired seeds, which is a user-scale run, not an afternoon.
The value head has nothing to say
The mechanism the search updates with is the value estimate q, the move network's outcome prediction averaged over belief-sampled rollouts. On 2,000 positions from the checkpoint's own self-play (16 games, seed 0, mean 747.8 plies, 12 draws and 4 blue wins), the value head's expected value correlates with the eventual outcome at Pearson -0.19, and every one of the 2,000 predictions falls in the middle fifth of the scale:
| Prediction bin | Count | Mean predicted | Mean realised |
|---|---|---|---|
| -1.0 to -0.6 | 0 | ||
| -0.6 to -0.2 | 0 | ||
| -0.2 to 0.2 | 2000 | -0.0742 | -0.0085 |
| 0.2 to 0.6 | 0 | ||
| 0.6 to 1.0 | 0 |
The predictions never leave the middle fifth of the scale, and what wiggling they do inside that band ranks the positions slightly backwards against the realised outcomes. The search diagnostics agree from the inside: across the 6,092 search moves of the first cell the q values of the legal moves spread by 0.019 on average, and the tabular update's top share of 0.103 is a near-uniform policy only mildly sharpened, with the beta-zero cell's amplified noise pushing its top share to 0.218 and its score nowhere. The paper's search needs a value head that ranks continuations and a belief that samples plausible opponents; on this checkpoint the value head carries no ranking (above) and the belief network was already shown worse than the counting prior (the learned-belief report).
Costs, measured while the machine was shared
| Player | ms per move | Games |
|---|---|---|
| search, 200 rollouts depth 10 | 339.7 | 24 |
| search, 200 rollouts depth 10, beta 0 | 251.0 | 24 |
| network alone | 2.99 to 3.1 | 248 |
All three were measured while other delegated agents used the machine, so they are upper bounds, not alone-on-the-machine numbers. The paper reports 1.26 s per move at 1,000 rollouts and depth 40 on one H100; this machine's 8.4 s per move at that budget is the cost the unrun cell is registered with.
Run records: the 200-by-10 cell, the beta-zero cell, the null pair.
What this bounds
These cells bound the search at this rung of the ladder, not the method in the paper: both search settings played a checkpoint thirty small iterations old whose value head is uninformative and whose belief sampler was rejected the same day, so the paper's Elo gains had neither of their two engines to run on. The point estimates lean the paper's way (search 0.208 above beta-zero 0.083, both above the null pair's 0.015) with no loss in 48 search games, which is a reason to retest rather than retire. The retest belongs on the scaled run's checkpoint, where the milestones measure a policy that beats greedy before search is asked to add to it, and the 1,000-by-40 cell needs a user-scale budget or a batched GPU rollout implementation before its 90 hours become an afternoon.
Reproduction
Registrations experiments/77aebde0-74c7-4a7a-9835-9c1f853b159e.toml
(the 200-by-10 cell), experiments/8c2d3e34-5fb9-4892-81a2-00689163a3f9.toml
(beta zero), experiments/85f9ec2b-1530-462d-9a8b-84b465a7917a.toml
(the null pair), and experiments/40af5091-8456-47e8-88ba-a74a6f3002ba.toml
(1,000 by 40, priced and not run). Commands, from the research root with
PYTHONPATH=training, the checkpoint being runs/belief-policy from the
learned-belief study:
.venv/bin/python -m armies_train match \
--red run:runs/belief-policy:search=200,depth=10,alpha=0.002,beta=0.02 \
--blue run:runs/belief-policy --games 24 --seed 0 --rules training \
--out runs/ue-cell-a.json
.venv/bin/python -m armies_train match \
--red run:runs/belief-policy:search=200,depth=10,alpha=0.002,beta=0 \
--blue run:runs/belief-policy --games 24 --seed 0 --rules training \
--out runs/ue-cell-c.json
.venv/bin/python -m armies_train match \
--red run:runs/belief-policy --blue run:runs/belief-policy \
--games 200 --seed 0 --rules training --out runs/ue-cell-d.json
.venv/bin/python -m armies_train calibrate \
--run runs/belief-policy --positions 2000 --games 16 --seed 0 \
--out runs/ue-calibrate.jsonThe search cells played in lock chunks of 5, 5 and 2 seeds. The
calibration JSON (SHA-256
902ff76f543643bfcd26804f5e88c3fa1cac8039837ee24c07c16ffce8ed6dbe, wall
4.1 s) sits in the study's raw output. Cell counts are 24 games where
the brief asked for 200: a search pair costs 320 to 650 s on this
machine, the registrations record the reduction, and the interval width
is the price.