Commit graph

5 commits

Author SHA1 Message Date
Frederic Jung
12ef18f9e6
Puzzles: eighteen puzzles in five packs with traffic, and their tests
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.
2026-10-29 10:48:24 +01:00
Frederic Jung
e90f5f675e
Puzzles: real traffic routed by the game, routers, link sizes and paths
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.
2026-10-29 10:35:28 +01:00
Frederic Jung
d3f550cc3e
Puzzles: budgets follow a difficulty curve
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.
2026-10-28 19:39:00 +01:00
Frederic Jung
19a9c60fd5
Puzzles: a cable fails as a whole in the N-1 check
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.
2026-10-28 19:35:29 +01:00
Frederic Jung
7fc8d0f080
Puzzles: small, calm network builds with stars, packs and a weekly puzzle (#190) 2026-10-28 16:21:25 +01:00