Host materials · includes answers
Welcome to the dusk observatory. The crew needs a slot long enough for setup and travel before the observing window closes. Your team has the original records on the table. First recover five pieces of information, then use the final plan to rebuild the dusk observing schedule. 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 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.
DUSK
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: DUSK.
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.
D
The before relationships connect all four events. Place linked cards, check any immediate handoff and then read the specified position. Result: D.
Start with the status field in Observer slips.
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 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.
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.
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.
SKETCH
Start with listed stock. Follow the printed dependencies until no new component becomes available; a circular dependency cannot create its first input. Result: SKETCH.
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-D-A-F-C-E
The five recovered order notes link all six events. Arrange them into one continuous order. Removing any link leaves two neighboring sections without a known order. Checked result: B-D-A-F-C-E.
Pause whenever the group needs a break. This is a planning estimate.