Host materials · includes answers
Welcome to the relay station. A receiver repeats its inputs; the crew must distinguish the signal order from an unordered training key. Your team has the original records on the table. First recover five pieces of information, then use the final plan to set the echo receiver. Keep every result beside its badge so another teammate can check your reasoning.
Rotate player roles · Choose a useful hint · Manage two teams
Look at the training cards that share one signal.
In an unordered pair, a word cannot be assigned by its left/right position. Use the overlap with another pair.
Give each signal a different word, check every training example and only then decode the received message in its printed order.
SEND-WAIT
A consistent one-to-one mapping satisfies every training example. Use the complete mapping to read the two-signal message in order. Result: SEND-WAIT.
Start with the status field in Relay log.
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.
TWINE
Check source status first, then join the matching tag. The useful information comes from separate records, not their printed row order. Result: TWINE.
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.
CLEAR
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: CLEAR.
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.
C-D
Compare coverage before weight. Only complete kits qualify; minimize their combined weight and report the selected cards in alphabetical order. Result: C-D.
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.
ECHO
Start with listed stock. Follow the printed dependencies until no new component becomes available; a circular dependency cannot create its first input. Result: ECHO.
Find the starting states, dial order and pulse-card key.
Each selected vector lists turns for every dial. Several different cards can affect the same dial.
Add one dial column at a time to its starting state, wrap around the three-state loop, then check that all five pulse cards were used.
A2-B0-C2-D1-E1
Select one pulse card for each of the five badge results. Add the turns by dial column to the printed starting states and wrap each total around 0, 1, 2. The checked configuration is A2-B0-C2-D1-E1; each pulse pair has equal size and total turns, so its shape does not identify the correct choice.
Pause whenever the group needs a break. This is a planning estimate.