Live search budget
Post-search diagnostic probe
The action was selected before this graph was serialized. Playback reveals only the later serializer probe; it does not invent traversal chronology.
Recorded search trace
Observability contract
Recorded guarantees
Remaining limitations
Evaluator comparison
Root action × world × chance outcome matrix
Depth and interior-to-resolved diagnostics
Live deadline comparison
NEW ROOT · +10s
→
EXECUTE POLICY
→
CACHED · +0s
CACHE MISS · +10s
↺
Same-turn information graph
How to read this graph
Each card is a position; each line is a move or a random outcome. Step through and the search grows one simulation at a time; the lit path is the simulation being played.
a movethe line the search chosea transpositiona random outcome (dashed = sampled)the opponent's movea move it droppedthe roota chance gatethe opponent to movethe turn endsnothing to decide
Current event paths isolates one simulation; Explored so far is the default; Full final topology shows everything at once. The execution timeline replays the chosen turn.
Realized game line · time ledger
Selected state