Host materials · includes answers
Welcome to the garden beacon hut. A repaired beacon begins at recorded dial states; every recovered pulse must be applied, including zero turns. Your team has the original records on the table. First recover five pieces of information, then use the final plan to configure the garden beacon. 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.
REST-OPEN
A consistent one-to-one mapping satisfies every training example. Use the complete mapping to read the two-signal message in order. Result: REST-OPEN.
Start with the status field in Beacon tests.
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.
EAST
Check source status first, then join the matching tag. The useful information comes from separate records, not their printed row order. Result: EAST.
Read the event letters and all three witness notes.
Join immediately-before pairs as a block; other before notes set the direction between blocks.
Try the remaining positions, then check every note against your full order before reading the requested position.
C
The before relationships connect all four events. Place linked cards, check any immediate handoff and then read the specified position. Result: C.
Find S, F, the required-stop list and any CLOSED edge.
A cheap shortcut is not a complete journey if it skips a required stop.
List the legal complete paths, add their edge costs and compare only paths that meet every condition.
S-A-C-D-F
Discard closed roads and paths missing A or D. Add the costs of every remaining edge; the lowest eligible total determines the whole route. Result: S-A-C-D-F.
Read the garden-beacon post cards and the requirements.
Compare the same named feature across cards; check negative requirements as carefully as positive ones.
Keep a card only if it passes every requirement. Point to the failing feature before crossing out each alternative.
GATE
Compare all printed features with every positive and negative requirement. Reject each near match using the particular requirement it fails. Result: GATE.
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.
A1-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 A1-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.