Welcome to the rooftop shuttle station. The shuttle route must visit a charger before it reaches the roof where the boxes are needed. Your team has the original records on the table. First recover five pieces of information, then use the final plan to plan the rooftop supply route. Keep every result beside its badge so another teammate can check your reasoning.
Find S, F, required stops C, L and any CLOSED edge.
Hint 2
First remove paths using closed roads or missing a required stop. More than one complete journey may remain.
Hint 3
Add the cost of every edge in each remaining journey. Compare the totals with the budget, then choose the cheapest eligible journey.
Reveal host answer
S-L-C-B-F
Visit C and L without using a closed edge. Eligible journeys within 9 units: S-L-C-B-F costs 4; S-C-B-L-F costs 7. The least-cost result is S-L-C-B-F.
2. Window
Hint 1
Look at earliest start, each window end and the arrival deadline.
Hint 2
The journey uses time as well as the job; add both to the start of each window.
Hint 3
Check all three conditions for each window. A slot can be long enough yet start too early or arrive too late.
Reveal host answer
T
Add job time and travel time to each printed start. Compare the sum with both that window's end and the deadline, then reject early starts. Result: T.
3. Signal
Hint 1
Look at the training cards that share one signal.
Hint 2
In an unordered pair, a word cannot be assigned by its left/right position. Use the overlap with another pair.
Hint 3
Give each signal a different word, check every training example and only then decode the received message in its printed order.
Reveal host answer
WAIT-TURN
A consistent one-to-one mapping satisfies every training example. Use the complete mapping to read the two-signal message in order. Result: WAIT-TURN.
4. Record
Hint 1
Start with the status field in Roof requests.
Hint 2
The tag links an item to a bay; rows in separate records need not line up.
Hint 3
Keep only entries meeting every status test. Follow each printed join to the report field; do not guess from row position.
Reveal host answer
NORTH
Check source status first, then join the matching tag. The useful information comes from separate records, not their printed row order. Result: NORTH.
5. Food
Hint 1
Find the stock line and the readiness cards.
Hint 2
AND needs every input; OR needs one. A future delivery is not current stock.
Hint 3
Mark supported components in rounds. Stop when no further component can be marked and compare the proposed results.
Reveal host answer
LIFT
Start with listed stock. Follow the printed dependencies until no new component becomes available; a circular dependency cannot create its first input. Result: LIFT.
6. Final
Needs: Path, Window, Signal, Record, Food
Hint 1
Keep the five named results beside the final plan and find the key for each badge.
Hint 2
Each badge controls a different fact, road leg, order note, pulse or habitat layer. Use the matching key exactly once.
Hint 3
Check the completed product against all five recovered facts. If two answers remain, locate the fact that distinguishes them rather than guessing.
Reveal host answer
B-C-F-G-K
Recover all five loads. The cheaper road works for a small load; a large load needs the higher-capacity road. The resulting five-leg route records every necessary decision. Checked result: B-C-F-G-K.
Suggested timeline
3 minutes: Read the opening. Show the evidence record and choose starting roles.
5 minutes: Solve Path. Offer one hint at a time and rotate roles after checking.
5 minutes: Solve Window. Offer one hint at a time and rotate roles after checking.
5 minutes: Solve Signal. Offer one hint at a time and rotate roles after checking.
5 minutes: Solve Record. Offer one hint at a time and rotate roles after checking.
5 minutes: Solve Food. Offer one hint at a time and rotate roles after checking.
7 minutes: Build the five-leg delivery route using all five results.
3 minutes: Read the ending. Ask each teammate to explain one rejected alternative.
Pause whenever the group needs a break. This is a planning estimate.