Puzzles on phones: three goals in plain words with Show me, the problem marked on the map, a sheet that starts small, and a quieter map

The stars become three goals; the current one says what is wrong and what to do. A red ring marks a city still short, a pulsing ✂ the link whose cut hurts. Cities far from the puzzle are left off the map, and idle stepping stones are nameless dots until tapped, used or zoomed in on.
This commit is contained in:
Frederic Jung 2026-11-04 21:48:13 +01:00
parent b2dddf8f06
commit 29af343739
No known key found for this signature in database
17 changed files with 256 additions and 20 deletions

View file

@ -112,7 +112,7 @@ test('stars come from traffic: capacity, latency caps, best effort and N-1 under
e = evalP(ev);
assert.ok(e.goal && !e.n1, 'still connected after a cut, but short');
assert.equal(Math.round(e.worst.g), 50, 'cutting the trench with two waves leaves 100G for 150G: 50G drop');
assert.match(ev("document.getElementById('pzBox').textContent"), /A cut on Frankfurt ⇄ Paris drops 50\.\d Gbps/);
assert.match(ev("document.getElementById('pzBox').textContent"), /If Frankfurt ⇄ Paris is cut, 50\.\d Gbps is lost on the way to Paris/);
build(ev, [['fra', 'par', 'land', 1, 2]]);
assert.ok(evalP(ev).n1, 'two waves in each trench: either one carries Paris alone');
// A latency cap: Grace Hopscotch is too slow for the traders; the eyeballs are best effort and may drop on a cut.