Interns: the same orders, each best at one part of the job

The three interns run every order the same way at the same salary;
each is now better at one thing, and says so when hired:
- Anycast Annie peers: the IX order runs every day, not only weekly, and
  the PNI order twice a week.
- Kevin from the night shift does maintenance: two line system swaps a
  night instead of one, and never a fat finger. He rolls the same dice
  (catching it before Enter), so a seeded game plays the same whoever is
  hired.
- Tracy Route plans ahead: the transit, ports, routers, optics and
  optical transport orders act as if traffic were already 10% higher
  (OPS_AHEAD).
This commit is contained in:
Frederic Jung 2026-11-06 20:23:18 +00:00
parent c96f9e7644
commit ed0cac9974
No known key found for this signature in database
13 changed files with 133 additions and 18 deletions

View file

@ -284,7 +284,8 @@ test('the mood follows the week, with no dice', t => {
test('fat fingers: never under Change Freeze, rare and harmless in On-call and BGP at 3 a.m.', t => {
const { ev, errors } = game(t);
hire(ev);
// Kevin never fat-fingers anything: Annie does, now and then.
ev("ACT.opsHire({id:'annie'});S.ops.floor=0;closeModal()");
ev('window.__r=Math.random;Math.random=()=>0');
for (let i = 0; i < 50; i++) shift(ev);
assert.equal(ev('S.ops.log.some(e=>e.f!==undefined)'), false, 'Change Freeze: never, even on the unluckiest roll');
@ -477,7 +478,8 @@ test('one order that throws is paused and noted; the rest of the shift and the d
test('the fat-fingered LAG member respects a paused transit order and per-POP exceptions', t => {
const { ev, errors } = game(t);
hire(ev);
// Kevin never fat-fingers anything: Annie does, now and then.
ev("ACT.opsHire({id:'annie'});S.ops.floor=0;closeModal()");
// Each shift rolls: fat finger yes, the only POP, the LAG slip (index 3).
ev("S.rules=makeRules('bgp');window.__r=Math.random;window.__k=0;Math.random=()=>[0,0,0.7][__k++%3]");
const n0 = ev('S.transit[0].n||1'), c0 = cash(ev);