Q7 — Waltz Line Labeling: One Solvable, One NIL

A rare consistent drawing — junctions 1–4 label as L2, Y1, L3, W3 — while the second drawing wipes out to NIL.

The Question

Same junction dictionary as the other papers (L1–L6, W1–W3, Y1–Y3, T1–T4, rotations allowed). Two drawings to label.

#DrawingOfficial answer
7.1Four-junction drawingL2, Y1, L3, W3 (junctions 1, 2, 3, 4 in order)
7.2Second line drawingNIL

The Topic in 60 Seconds

Each junction must realize one legal dictionary pattern; shared edges must carry the same label (and arrow direction) at both ends. Empty domain ⇒ NIL — a fully consistent assignment means the answer is the label list itself.

Deep-dive: Waltz Line Labeling.

The dictionary entries that matter here

LabelGeometry
L2one arrow pointing away from the corner + one concave (−-) edge
L3one concave (−-) edge + one arrow pointing into the corner
Y1arrows into the junction on two edges, −- on the third
W3++ on one diagonal, −- on the stem, ++ on the other diagonal

7.1 — A consistent labeling exists → L2, Y1, L3, W3

The official key assigns junctions 1, 2, 3, 4 = L2, Y1, L3, W3. How to verify it fast in the exam:

  1. Classify the four junctions from the drawing (here: two L's, one Y, one W).
  2. Start at the Y (junction 2) — Y1 pins arrows on two of its edges and −- on the third. That is the most constrained junction, so everything downstream follows from it.
  3. Propagate each pinned edge to its neighbour: an arrow leaving the Y arrives at an L corner, selecting the arrow+−- pattern there (L2 if it points away from that corner, L3 if it points into it), and the −- edge feeds the W.
  4. Close at the W (junction 4): its diagonals take ++, its stem takes −- — exactly W3. Every junction holds one legal pattern and every shared edge agrees at both ends ⇒ consistent ⇒ the answer is the label list L2, Y1, L3, W3 ✓

Watch the assignment lock in:

1 / 4
From the drawing: J1 = L-type · J2 = Y-type · J3 = L-type · J4 = W-type Domains: L has 6 patterns, Y has 3, W has 3.
unassignedbeing labeledlabeled (legal pattern)

7.2 — The second drawing → NIL

Same method: classify, force the most constrained junction, propagate. Here the forced labels reach a junction whose remaining patterns all demand an edge label already ruled out — the domain empties → NIL ✓

The kill typically lands like this:

  1. A T-junction's bar arrows pin two edges immediately.
  2. Propagation forces a neighbouring junction into a pattern that over-constrains their shared edge.
  3. The last junction needs, say, two arrows pointing into it (any Y pattern) but every remaining edge already carries its arrowhead (or a +/−)+/-) at the other end. No dictionary pattern survives → domain size zero → inconsistent.

Tricks & Tips

Answers: 7.1 L2,Y1,L3,W3 · 7.2 NIL