Host materials · includes answers
Welcome to the river bridge workshop. The convoy must collect rope before the crossing, avoid a closed lane and carry enough repair supplies. Your team has the original records on the table. First recover five pieces of information, then use the final plan to route the bridge repair convoy. Keep every result beside its badge so another teammate can check your reasoning.
Rotate player roles · Choose a useful hint · Manage two teams
Find S, F, required stops R, T and any CLOSED edge.
First remove paths using closed roads or missing a required stop. More than one complete journey may remain.
Add the cost of every edge in each remaining journey. Compare the totals with the budget, then choose the cheapest eligible journey.
S-R-T-F
Visit R and T without using a closed edge. Eligible journeys within 10 units: S-R-T-F costs 7; S-R-X-T-F costs 9. The least-cost result is S-R-T-F.
Read each supply card and the three required needs.
A light card alone may leave a need uncovered; a shared supply counts for both needs.
Compare complete combinations, adding each chosen card weight once. Reject any combination over the limit before choosing the lightest.
A-B
Compare coverage before weight. Only complete kits qualify; minimize their combined weight and report the selected cards in alphabetical order. Result: A-B.
Start with the status field in Tool requests.
The tag links an item to a bay; rows in separate records need not line up.
Keep only entries meeting every status test. Follow each printed join to the report field; do not guess from row position.
KITE
Check source status first, then join the matching tag and bay. The useful information comes from separate records, not their printed row order. Result: KITE.
Look at earliest start, each window end and the arrival deadline.
The journey uses time as well as the job; add both to the start of each window.
Check all three conditions for each window. A slot can be long enough yet start too early or arrive too late.
MID
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: MID.
Find the stock line and the readiness cards.
AND needs every input; OR needs one. A future delivery is not current stock.
Mark supported components in rounds. Stop when no further component can be marked and compare the proposed results.
WALK
Start with listed stock. Follow the printed dependencies until no new component becomes available; a circular dependency cannot create its first input. Result: WALK.
Keep the five named results beside the final plan and find the key for each badge.
Each badge controls a different fact, road leg, order note, pulse or habitat layer. Use the matching key exactly once.
Check the completed product against all five recovered facts. If two answers remain, locate the fact that distinguishes them rather than guessing.
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.
Pause whenever the group needs a break. This is a planning estimate.