Host materials · includes answers
Welcome to the fictional canopy survey. The nest must match a linked food web and provide five different parts without cutting any paper. Your team has the original records on the table. First recover five pieces of information, then use the final plan to assemble the canopy nest model. Keep every result beside its badge so another teammate can check your reasoning.
Rotate player roles · Choose a useful hint · Manage two teams
Start at the available-now line in Canopy food web.
AND needs every input; OR needs one. A circular pair cannot create its first input.
Mark newly supported results in rounds. Repeat until no further result can be marked, then compare only the listed targets.
PEEP
Start with LEAF+NECTAR. Newly supported in order: NIB+FLIT > GLIM > PEEP. PEEP needs GLIM OR SEED; that rule is met. Other listed targets remain unsupported.
Start with the status field in Nest cards.
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 canopy nest profiles 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.
CUP
Compare all printed features with every positive and negative requirement. Reject each near match using the particular requirement it fails. Result: CUP.
Find S, F, required stops B 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-A-B-F
Visit B without using a closed edge. Eligible journeys within 8 units: S-A-B-F costs 5; S-C-B-F costs 7. The least-cost result is S-A-B-F.
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.
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.
R1-F2-W1-D2-E1
Each recovered field result sets one separate habitat requirement. Match all five layers; a complete plan must include suitable cover, ground, water, food and access. Checked result: R1-F2-W1-D2-E1.
Pause whenever the group needs a break. This is a planning estimate.