Host materials · includes answers
Welcome to the friendly dragon post. The dragon can carry every bundle, but narrow gates limit the loads on its ground route. Your team has the original records on the table. First recover five pieces of information, then use the final plan to choose the dragon delivery route. 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, 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-F
Discard closed roads and paths missing A. Add the costs of every remaining edge; the lowest eligible total determines the whole route. Result: S-A-C-F.
Start with the status field in Bundle list.
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.
Find all the event cards and the before notes.
Connect cards linked by the notes; a card position is counted from the beginning of the completed order.
Check every before relationship, then read only the requested position. The printed card arrangement is not the answer order.
6
The only order is Read address > Pack gift > Check gate > Deliver gift. Position 2 carries 6. Result: 6.
Find the equal parcels and the separate loose units.
Remove the loose units before sharing the remaining weight among equal parcels.
Find one parcel from the first equation, then substitute that weight into the second equation before recording it.
7
Remove 4 from 18; share 14 among 2 parcels to get 7. Check 2 x 7 + 3 = 17. Result: 7.
Find the symbol key and the message strip.
Use the same key every time a symbol repeats. Read the message in its printed order.
Write the complete decoded word, check every symbol, then use the conversion row for that exact word.
1
The decoded word is WING; its row gives 1. Result: 1.
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.