Party Puzzle Parcel

Print the player sheets

Choose your paper size in the browser dialog, then Print or Save as PDF. For exact A4 or Letter pages and the separate record sheets, use the downloadable player materials.

Friendly Dragon Delivery — clue 1: Path

Trace a legal supply journey from S to F. The map's arrows are one-way roads. Visit every required stop, stay inside the travel budget and use the cheapest complete journey. Report all stop letters.

friendly dragon post: delivery mapTravel map (one way) S > A: 2 units S > B: 1 units A > C: 2 units B > C: 2 units C > F: 2 units B > F: 2 units A > F: 7 units Journey rules Start S; finish F; limit 7 units. Visit A. Use the least total cost. Write every stop in order, with hyphens.Travel map (one way)S > A: 2 unitsS > B: 1 unitsA > C: 2 unitsB > C: 2 unitsC > F: 2 unitsB > F: 2 unitsA > F: 7 unitsJourney rulesStart S; finish F; limit 7 units.Visit A. Use the least total cost.Write every stop in order, with hyphens.

Path result: __________________

Party Puzzle Parcel · 2.0.0

Friendly Dragon Delivery — clue 2: Record

Use the bundle list and gate register to follow the completed record. Match printed keys, then report the requested field. A planned or cancelled entry cannot prove a move.

the invitation bundles: follow the recordBundle list item: Gate | tag: PINE | status: checked item: Bridge | tag: WAVE | status: cancelled item: Ridge | tag: STAR | status: draft Gate register tag: STAR | bay: NORTH tag: PINE | bay: EAST tag: WAVE | bay: WEST Cross-check Match A.tag to B.tag. A.status is not cancelled. A.status is not draft. Report B.bay.Bundle listitem: Gate | tag: PINE | status: checkeditem: Bridge | tag: WAVE | status: cancelleditem: Ridge | tag: STAR | status: draftGate registertag: STAR | bay: NORTHtag: PINE | bay: EASTtag: WAVE | bay: WESTCross-checkMatch A.tag to B.tag.A.status is not cancelled.A.status is not draft.Report B.bay.

Record result: __________________

Party Puzzle Parcel · 2.0.0

Friendly Dragon Delivery — clue 3: Flight

Flight desk: Combine every BEFORE rule to order the four actions. Write positions on the whole-sheet cards. Read position 2.

Flight clueCards: Pack gift [6]; Deliver gift [0]; Check gate [8]; Read address [4]. Rules: Read address BEFORE Check gate; Pack gift BEFORE Deliver gift; Check gate BEFORE Deliver gift; Read address BEFORE Pack gift; Pack gift BEFORE Check gate. Read card position 2.Pack gift [6]Deliver gift [0]Check gate [8]Read address [4]Read address BEFORE Check gatePack gift BEFORE Deliver giftCheck gate BEFORE Deliver giftRead address BEFORE Pack giftPack gift BEFORE Check gateRead position 2 (positions start at 1).

Flight result: __________________

Party Puzzle Parcel · 2.0.0

Friendly Dragon Delivery — clue 4: Load

Load desk: Every parcel has the same whole-number weight. Remove loose units, find ONE parcel and check the second rule.

Load clue2 parcels + 4 loose units = 18 units 2 parcels + 3 loose units = 17 units One parcel = ? units. Whole numbers 1–9. All parcels have equal weight.2 parcels + 4 loose units = 18 units2 parcels + 3 loose units = 17 unitsOne parcel = ? units. Whole numbers 1–9.All parcels have equal weight.

Load result: __________________

Party Puzzle Parcel · 2.0.0

Friendly Dragon Delivery — clue 5: Code

Code desk: Decode all shapes in message order. Repeated shapes repeat their letter. Convert the full word using the table.

Code clueKey: hexagon means W; triangle means I; square means N; circle means G. Message: hexagon, triangle, square, circle. Conversion: WING means 1; MAIL means 4; LAMP means 7.hexagon = Wtriangle = Isquare = Ncircle = GhexagontrianglesquarecircleWING = 1MAIL = 4LAMP = 7

Code result: __________________

Party Puzzle Parcel · 2.0.0

Friendly Dragon Delivery — clue 6: Final

Use each result to recover the load for its leg. At each leg choose the cheapest road that can carry that load. A road with too little capacity is closed to this cargo. Report the five road IDs in journey order.

Write the complete delivery routeCargo key, one leg at a time Leg 1 (Path): S-A-F=2; S-A-C-F=4 Leg 2 (Record): EAST=2; NORTH=4 Leg 3 (Flight): 0=2; 6=4 Leg 4 (Load): 1=4; 7=2 Leg 5 (Code): 1=4; 4=2 Roads: load capacity / travel cost 1: B 6/4 | A 3/2 2: C 3/2 | D 6/4 3: F 6/4 | E 3/2 4: G 3/2 | H 6/4 5: K 6/4 | J 3/2 Route rule Choose the cheapest road carrying each load. Report the five road IDs in leg order, with hyphens.Cargo key, one leg at a timeLeg 1 (Path): S-A-F=2; S-A-C-F=4Leg 2 (Record): EAST=2; NORTH=4Leg 3 (Flight): 0=2; 6=4Leg 4 (Load): 1=4; 7=2Leg 5 (Code): 1=4; 4=2Roads: load capacity / travel cost1: B 6/4 | A 3/22: C 3/2 | D 6/43: F 6/4 | E 3/24: G 3/2 | H 6/45: K 6/4 | J 3/2Route ruleChoose the cheapest road carrying each load.Report the five road IDs in leg order, with hyphens.

Final result: __________________

Party Puzzle Parcel · 2.0.0