Fat Pipes, Router Rodeo, Traffic Cops, N-1 Club and Grand Tour. Every puzzle has
1-star and 3-star references played through the player's actions; budgets sit
over the cheapest 3-star build the solver found, and the tests check that no
single change keeps three stars for less.
Every puzzle now carries demand (eyeballs pulling from a content origin, circuits
with latency caps, best-effort flows) routed by compute(). Stars: delivered,
within budget, N-1 under load. Routers, ports, metrics, standby and the
redundancy check work in puzzles; the whole world is open. Weekly schema 2
carries the demand; scripts/lib/puzzle-solver.js sizes and searches builds.
The first pack leaves 16-18% over the cheapest three-star build, the Pacific and
speed packs about 10%, and the N-1 Club 6-7%. The first pack no longer promises
no budget. A brute-force check in the tests keeps each reference build the cheapest.
Two waves on the same cable now share one failure, as in the main game's
diversity checks. Kiwi Fruit Salad gets Los Angeles as a stepping stone (Seattle's
only cable south is Hawaiki), Samba Sprint's budget rises to $1.06M, and the
weekly reference ring never puts two hops on one cable.