Keep puzzles and scenarios on plain shares; per-city share sums; tests follow the new traffic split
Puzzles, Architect runs and scenarios keep the table's split (their references and pars were made with it). Week 2026-W44's reference now wins on day 185 (offers draw from the wider campus list). The cache planner sums each city's own split.
This commit is contained in:
parent
69cdb3e372
commit
a98e34711b
6 changed files with 18 additions and 10 deletions
|
|
@ -189,7 +189,9 @@ test('a customer dropped while a sales trial routes: the trial runs again on the
|
|||
p.ev(TICK_ERR);
|
||||
p.ev("window.__ot=0;const ot=offerTrial;offerTrial=(...a)=>{__ot++;return ot(...a);};");
|
||||
let found = false;
|
||||
for (let d = 0; d < 20 && !found; d++) {
|
||||
// Played until such a trial comes: on the big save that is day 51 (where each city's traffic goes decides which
|
||||
// offers pass, #48).
|
||||
for (let d = 0; d < 60 && !found; d++) {
|
||||
p.ev('rwDay()');
|
||||
for (let k = 0; k < 400 && p.ev('!!RW.job'); k++) {
|
||||
if (p.ev('__later.length')) { p.ev('__later.shift()()'); continue; }
|
||||
|
|
|
|||
|
|
@ -27,7 +27,8 @@ function twoPops() {
|
|||
}
|
||||
|
||||
test('at its own POP a carrier\'s port takes the traffic bound for that carrier, not an even split', () => {
|
||||
const { ev, lvl, tly, errors } = newYork();
|
||||
// Both ports with room: New York's traffic to the US eyeballs in Level Tree's cone alone would fill its port (#48).
|
||||
const { ev, lvl, tly, errors } = newYork(1, 150);
|
||||
assert.ok(via(ev, lvl, 'lvl') > 1, 'Level Tree traffic goes out of the Level Tree port');
|
||||
assert.equal(via(ev, tly, 'lvl'), 0, 'and none of it out of Tell-Ya');
|
||||
assert.ok(via(ev, tly, 'tly') > 1 && via(ev, lvl, 'tly') === 0, 'the same for Tell-Ya');
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue