hillclimb tree2

Live archive tree of one search, drawn like the Darwin Gödel Machine's.

Same layout as tree; each circle carries its candidate number (c017 → 17) inside, is filled with its score on a viridis ramp (bright = best; hollow = no working solution), and ringed by what the search did with it: white = expanded (the spine the policy walked), no ring = scored and never built on, red = failed. The final best is a white star, and its parent chain is drawn bold in the same white. Circles never overlap: they are sized to the zoom, and the numbers appear as they grow. Scroll zooms, drag pans, click a node for details, enter opens it, j/k scrub through time, n/p switch search, ? keys.

hillclimb tree2 [SEARCH]

Arguments