GAMES FOR GOOD COMPANY · Original print & play
R✦RRound & Revel

Host material / spoilers ahead

After-Hours Answer Guide

Separate solutions for the October 13 ten-game collection.

Keep this away from players until they ask for help. This page is marked noindex,nofollow, which is not password protection.

The Shrinking Brief

SB01-Q / Receiver QUESTIONS / The mended kite stall

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. On which day will the stall open?
2. Where will the repairs happen?
3. What payment is needed for a repair?
4. What is needed to make a new kite?

SB01-A / Covered ANSWERS / The mended kite stall

Do not open until all four receiver answers are locked.
1. Saturday. Friday is the superseded plan.
2. Inside the glasshouse. Courtyard is incorrect for the repairs.
3. Nothing; repairs are free.
4. A blue token. Both blue and token must be clear.

SB02-Q / Receiver QUESTIONS / The lantern walk

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Where does the walk start?
2. What kind of lantern may walkers bring?
3. Where does the normal route finish?
4. Where does the group meet if wind cancels the walk?

SB02-A / Covered ANSWERS / The lantern walk

Do not open until all four receiver answers are locked.
1. The clock tower.
2. A paper lantern with no flame. Both material and absence of flame are required.
3. The mill.
4. The reading room.

SB03-Q / Receiver QUESTIONS / The borrowed blankets

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Which desk gives out blankets?
2. Which desk receives returned blankets?
3. Should visitors return the green bag?
4. Which picnic area should visitors use?

SB03-A / Covered ANSWERS / The borrowed blankets

Do not open until all four receiver answers are locked.
1. The north desk.
2. The south desk.
3. No; keep the bag.
4. The orchard.

SB04-Q / Receiver QUESTIONS / A quiet cinema afternoon

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. When does the film start?
2. Will there be a live piano performance?
3. Which tickets admit people today?
4. Which door should arriving guests use?

SB04-A / Covered ANSWERS / A quiet cinema afternoon

Do not open until all four receiver answers are locked.
1. At two; 2 o’clock is sufficient.
2. No; the advertised piano performance is cancelled.
3. White tickets.
4. The side door.

SB05-Q / Receiver QUESTIONS / The seed exchange

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Where is the exchange?
2. How should donated seeds be packaged?
3. May someone who brings no seeds take an envelope?
4. May visitors take seeds from the red display table?

SB05-A / Covered ANSWERS / The seed exchange

Do not open until all four receiver answers are locked.
1. The old school hall. School hall is sufficient.
2. In a labelled paper envelope. Labelled, paper, and envelope must be clear.
3. Yes; one envelope may be taken.
4. No; display seeds stay at the red table.

SB06-Q / Receiver QUESTIONS / The rehearsal change

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. When is the rehearsal?
2. When is the public show?
3. What should performers bring to rehearsal?
4. Which entrance should rehearsal performers use?

SB06-A / Covered ANSWERS / The rehearsal change

Do not open until all four receiver answers are locked.
1. Thursday at three. Both day and time are required.
2. Saturday at five. Both day and time are required.
3. Their puppets; scenery should stay home. Puppets alone is sufficient, but “puppets and scenery” is wrong.
4. The front entrance.

SB07-Q / Receiver QUESTIONS / The repaired toy train

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. When does the first demonstration begin?
2. Where do later demonstrations begin?
3. May visitors ride the train?
4. What does a red flag mean?

SB07-A / Covered ANSWERS / The repaired toy train

Do not open until all four receiver answers are locked.
1. At noon.
2. At the tunnel model.
3. No; nobody rides the model.
4. A pause, not the end of the afternoon. “Pause” alone is sufficient.

SB08-Q / Receiver QUESTIONS / The recipe display

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. On which day does the display close?
2. Which recipe cards must stay in the display?
3. Where should completed new cards go?
4. Is there food to taste?

SB08-A / Covered ANSWERS / The recipe display

Do not open until all four receiver answers are locked.
1. Friday.
2. Cards marked with a star.
3. The wooden box.
4. No; there is no food to taste.

SB09-Q / Receiver QUESTIONS / The rooftop telescope

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Where does the demonstration happen in cloudy weather?
2. Where are numbered cards collected?
3. What tells a visitor that it is their turn?
4. Which item may a visitor keep?

SB09-A / Covered ANSWERS / The rooftop telescope

Do not open until all four receiver answers are locked.
1. The downstairs model room. Model room is sufficient.
2. The foyer.
3. Their numbered card’s number is called.
4. The small sky map; the numbered card must be returned. Sky map alone is sufficient.

SB10-Q / Receiver QUESTIONS / The winter window trail

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Which sign marks the current trail?
2. Which listed window should be skipped?
3. Is there a replacement for the skipped window?
4. Where do completed sheets go?

SB10-A / Covered ANSWERS / The winter window trail

Do not open until all four receiver answers are locked.
1. A moon sign.
2. The fifth window; number 5 is sufficient.
3. No; there is no replacement.
4. The post-office box. A box at the post office is sufficient.

SB11-Q / Receiver QUESTIONS / The rolling book cart

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. Where is the cart on Tuesday afternoon?
2. Where is it on Friday morning?
3. Must a book go back to the same stop where it was borrowed?
4. Can lower-shelf magazines be borrowed?

SB11-A / Covered ANSWERS / The rolling book cart

Do not open until all four receiver answers are locked.
1. The square.
2. The station.
3. No; either stop accepts returns.
4. No; the magazines are display copies.

SB12-Q / Receiver QUESTIONS / The paper parade

CUT AND COVER SEPARATELY FROM THE ANSWER CARD. Receiver opens only after accepting the 6-word message.
1. When does the parade leave?
2. May decorations be tied to trees?
3. Which route is used if the bridge is wet?
4. Where does the parade end?

SB12-A / Covered ANSWERS / The paper parade

Do not open until all four receiver answers are locked.
1. Half past ten; 10:30 is sufficient. Ten is gathering time, not departure.
2. No; carry them by hand.
3. The longer path around the pond. Around the pond is sufficient.
4. The bandstand.

Cue Club

CC01-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: B → C → D → A. Cue trace: DOT → CURL → CURL → CURL → BAR. The cue after two stations is CURL, and the final cue is BAR. Exactly 4 of the 24 possible station orders satisfy both targets: BCDA; BDAC; BDCA; CBDA. Other orders may satisfy only one target. Every listed order is equally valid.

CC02-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: B → D → A → C. Cue trace: BAR → DOT → BAR → BAR → CURL. The cue after two stations is BAR, and the final cue is CURL. Exactly 2 of the 24 possible station orders satisfy both targets: BDAC; BDCA. Other orders may satisfy only one target. Every listed order is equally valid.

CC03-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: B → D → A → C. Cue trace: CURL → BAR → BAR → CURL → CURL. The cue after two stations is BAR, and the final cue is CURL. Exactly 4 of the 24 possible station orders satisfy both targets: BDAC; CBAD; CBDA; DBAC. Other orders may satisfy only one target. Every listed order is equally valid.

CC04-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: A → C → D → B. Cue trace: DOT → CURL → CURL → DOT → BAR. The cue after two stations is CURL, and the final cue is BAR. Exactly 2 of the 24 possible station orders satisfy both targets: ACDB; CADB. Other orders may satisfy only one target. Every listed order is equally valid.

CC05-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: B → C → A → D. Cue trace: BAR → BAR → DOT → CURL → BAR. The cue after two stations is DOT, and the final cue is BAR. Exactly 2 of the 24 possible station orders satisfy both targets: BCAD; CBAD. Other orders may satisfy only one target. Every listed order is equally valid.

CC06-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: A → B → C → D. Cue trace: CURL → DOT → DOT → BAR → DOT. The cue after two stations is DOT, and the final cue is DOT. Exactly 4 of the 24 possible station orders satisfy both targets: ABCD; ABDC; BDAC; CBDA. Other orders may satisfy only one target. Every listed order is equally valid.

CC07-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: C → D → A → B. Cue trace: DOT → BAR → BAR → DOT → CURL. The cue after two stations is BAR, and the final cue is CURL. Exactly 2 of the 24 possible station orders satisfy both targets: CDAB; DCAB. Other orders may satisfy only one target. Every listed order is equally valid.

CC08-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: B → D → A → C. Cue trace: BAR → DOT → DOT → CURL → DOT. The cue after two stations is DOT, and the final cue is DOT. Exactly 2 of the 24 possible station orders satisfy both targets: BDAC; DBAC. Other orders may satisfy only one target. Every listed order is equally valid.

CC09-KEY / Covered route check

Keep covered until the final route is resolved. One checked solution: A → D → B → C. Cue trace: CURL → BAR → CURL → DOT → DOT. The cue after two stations is CURL, and the final cue is DOT. Exactly 4 of the 24 possible station orders satisfy both targets: ADBC; BADC; DABC; DBCA. Other orders may satisfy only one target. Every listed order is equally valid.

Borderless Walk

BW01 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → A2 → B2 → C2 → D2 → D1 → C1 → C4 → B4 → B3 → A3 → D3 → D4 → A4 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A3–D3, A4–D4 (H=2). Vertical seam links: A1–A4, C1–C4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW02 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes B1–B2. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: B1 → B2 → A2 → A3 → A4 → D4 → C4 → C1 → D1 → D2 → C2 → C3 → B3 → B4 → B1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A4–D4 (H=1). Vertical seam links: B1–B4, C1–C4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW03 · Hints and complete solution

Gentle hint: C1 has only two open neighbors: D1 and B1. Both of those links are forced.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → D1 → C1 → B1 → B2 → A2 → D2 → D3 → A3 → B3 → B4 → A4 → A1.

There are 12 open cells and 12 distinct links. Horizontal seam links: A1–D1, A2–D2, A3–D3 (H=3). Vertical seam links: A1–A4 (V=1). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW04 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes C1–C4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: C1 → C2 → B2 → B3 → C3 → D3 → D4 → D1 → D2 → A2 → A3 → A4 → B4 → C4 → C1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A2–D2 (H=1). Vertical seam links: C1–C4, D1–D4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW05 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–D1. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → D1 → D2 → C2 → B2 → B1 → C1 → C4 → D4 → A4 → B4 → B3 → A3 → A2 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A1–D1, A4–D4 (H=2). Vertical seam links: C1–C4 (V=1). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW06 · Hints and complete solution

Gentle hint: A3 has only two open neighbors: B3 and D3. Both of those links are forced.

Stronger hint: The final loop includes C1–C4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: C1 → C2 → D2 → D1 → D4 → D3 → A3 → B3 → C3 → C4 → C1.

There are 10 open cells and 10 distinct links. Horizontal seam links: A3–D3 (H=1). Vertical seam links: C1–C4, D1–D4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW07 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–A2. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → B1 → C1 → D1 → D4 → A4 → B4 → C4 → C3 → D3 → A3 → B3 → B2 → A2 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A4–D4, A3–D3 (H=2). Vertical seam links: D1–D4 (V=1). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW08 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → A2 → D2 → D3 → A3 → B3 → B4 → C4 → C3 → C2 → C1 → D1 → D4 → A4 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A2–D2, A3–D3, A4–D4 (H=3). Vertical seam links: A1–A4, D1–D4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW09 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → B1 → B2 → B3 → A3 → A2 → D2 → C2 → C1 → C4 → C3 → D3 → D4 → A4 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A2–D2, A4–D4 (H=2). Vertical seam links: A1–A4, C1–C4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW10 · Hints and complete solution

Gentle hint: B1 has only two open neighbors: C1 and A1. Both of those links are forced.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → B1 → C1 → C2 → C3 → C4 → D4 → D3 → D2 → A2 → A3 → A4 → A1.

There are 12 open cells and 12 distinct links. Horizontal seam links: A2–D2 (H=1). Vertical seam links: A1–A4 (V=1). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW11 · Hints and complete solution

Gentle hint: B1 has only two open neighbors: B2 and B4. Both of those links are forced.

Stronger hint: The final loop includes B1–B4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: B1 → B2 → C2 → C3 → B3 → A3 → A2 → D2 → D1 → D4 → A4 → B4 → B1.

There are 12 open cells and 12 distinct links. Horizontal seam links: A2–D2, A4–D4 (H=2). Vertical seam links: B1–B4, D1–D4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

BW12 · Hints and complete solution

Gentle hint: Start at the fixed links. A cell already touched twice cannot accept a third final link. Then check the exact seam totals before closing any small loop.

Stronger hint: The final loop includes A1–A4. Add that link, then reconsider the neighboring cells.

Solution, closing back to the start: A1 → D1 → D2 → A2 → A3 → B3 → C3 → C2 → B2 → B1 → C1 → C4 → B4 → A4 → A1.

There are 14 open cells and 14 distinct links. Horizontal seam links: A1–D1, A2–D2 (H=2). Vertical seam links: A1–A4, C1–C4 (V=2). Every fixed link is included. Reversing this sequence or beginning at another listed cell gives the same valid loop.

Turnover Archive

TA01 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 1 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 1 L → [2 NIGHT; 1 DAY] | [3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 1 R → [1 NIGHT; 2 DAY; 3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  3. 3 R → [1 NIGHT; 2 DAY; 3 DAY] | [4 DAY] | [5 NIGHT; 6 DAY]
  4. 2 L → [1 NIGHT; 2 DAY; 3 DAY] | [6 NIGHT; 5 DAY; 4 DAY]
  5. 1 L → [4 NIGHT; 5 NIGHT; 6 DAY; 1 NIGHT; 2 DAY; 3 DAY]

Final stack: [4 NIGHT; 5 NIGHT; 6 DAY; 1 NIGHT; 2 DAY; 3 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA02 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 3 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 3 L → [1 DAY] | [2 DAY] | [4 NIGHT; 3 DAY] | [5 DAY] | [6 DAY]
  2. 3 R → [1 DAY] | [2 DAY] | [3 NIGHT; 4 DAY; 5 DAY] | [6 DAY]
  3. 2 R → [1 DAY] | [2 NIGHT; 3 NIGHT; 4 DAY; 5 DAY] | [6 DAY]
  4. 2 L → [1 DAY] | [6 NIGHT; 2 NIGHT; 3 NIGHT; 4 DAY; 5 DAY]
  5. 1 R → [1 NIGHT; 6 NIGHT; 2 NIGHT; 3 NIGHT; 4 DAY; 5 DAY]

Final stack: [1 NIGHT; 6 NIGHT; 2 NIGHT; 3 NIGHT; 4 DAY; 5 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA03 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 2 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 2 L → [1 DAY] | [3 NIGHT; 2 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 1 L → [2 NIGHT; 3 DAY; 1 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  3. 2 L → [2 NIGHT; 3 DAY; 1 DAY] | [5 NIGHT; 4 DAY] | [6 DAY]
  4. 1 L → [4 NIGHT; 5 DAY; 2 NIGHT; 3 DAY; 1 DAY] | [6 DAY]
  5. 1 R → [1 NIGHT; 3 NIGHT; 2 DAY; 5 NIGHT; 4 DAY; 6 DAY]

Final stack: [1 NIGHT; 3 NIGHT; 2 DAY; 5 NIGHT; 4 DAY; 6 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA04 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 1 R. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 1 R → [1 NIGHT; 2 DAY] | [3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 1 L → [3 NIGHT; 1 NIGHT; 2 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  3. 3 R → [3 NIGHT; 1 NIGHT; 2 DAY] | [4 DAY] | [5 NIGHT; 6 DAY]
  4. 2 R → [3 NIGHT; 1 NIGHT; 2 DAY] | [4 NIGHT; 5 NIGHT; 6 DAY]
  5. 1 R → [2 NIGHT; 1 DAY; 3 DAY; 4 NIGHT; 5 NIGHT; 6 DAY]

Final stack: [2 NIGHT; 1 DAY; 3 DAY; 4 NIGHT; 5 NIGHT; 6 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA05 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 1 R. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 1 R → [1 NIGHT; 2 DAY] | [3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 2 L → [1 NIGHT; 2 DAY] | [4 NIGHT; 3 DAY] | [5 DAY] | [6 DAY]
  3. 1 L → [3 NIGHT; 4 DAY; 1 NIGHT; 2 DAY] | [5 DAY] | [6 DAY]
  4. 1 R → [2 NIGHT; 1 DAY; 4 NIGHT; 3 DAY; 5 DAY] | [6 DAY]
  5. 1 R → [5 NIGHT; 3 NIGHT; 4 DAY; 1 NIGHT; 2 DAY; 6 DAY]

Final stack: [5 NIGHT; 3 NIGHT; 4 DAY; 1 NIGHT; 2 DAY; 6 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA06 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 2 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 2 L → [1 DAY] | [3 NIGHT; 2 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 2 L → [1 DAY] | [4 NIGHT; 3 NIGHT; 2 DAY] | [5 DAY] | [6 DAY]
  3. 3 L → [1 DAY] | [4 NIGHT; 3 NIGHT; 2 DAY] | [6 NIGHT; 5 DAY]
  4. 2 L → [1 DAY] | [5 NIGHT; 6 DAY; 4 NIGHT; 3 NIGHT; 2 DAY]
  5. 1 L → [2 NIGHT; 3 DAY; 4 DAY; 6 NIGHT; 5 DAY; 1 DAY]

Final stack: [2 NIGHT; 3 DAY; 4 DAY; 6 NIGHT; 5 DAY; 1 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA07 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 1 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 1 L → [2 NIGHT; 1 DAY] | [3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 1 L → [3 NIGHT; 2 NIGHT; 1 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  3. 3 R → [3 NIGHT; 2 NIGHT; 1 DAY] | [4 DAY] | [5 NIGHT; 6 DAY]
  4. 2 L → [3 NIGHT; 2 NIGHT; 1 DAY] | [6 NIGHT; 5 DAY; 4 DAY]
  5. 1 L → [4 NIGHT; 5 NIGHT; 6 DAY; 3 NIGHT; 2 NIGHT; 1 DAY]

Final stack: [4 NIGHT; 5 NIGHT; 6 DAY; 3 NIGHT; 2 NIGHT; 1 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA08 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 1 R. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 1 R → [1 NIGHT; 2 DAY] | [3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 1 R → [2 NIGHT; 1 DAY; 3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  3. 1 L → [4 NIGHT; 2 NIGHT; 1 DAY; 3 DAY] | [5 DAY] | [6 DAY]
  4. 2 R → [4 NIGHT; 2 NIGHT; 1 DAY; 3 DAY] | [5 NIGHT; 6 DAY]
  5. 1 R → [3 NIGHT; 1 NIGHT; 2 DAY; 4 DAY; 5 NIGHT; 6 DAY]

Final stack: [3 NIGHT; 1 NIGHT; 2 DAY; 4 DAY; 5 NIGHT; 6 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA09 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 3 R. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 3 R → [1 DAY] | [2 DAY] | [3 NIGHT; 4 DAY] | [5 DAY] | [6 DAY]
  2. 4 R → [1 DAY] | [2 DAY] | [3 NIGHT; 4 DAY] | [5 NIGHT; 6 DAY]
  3. 3 L → [1 DAY] | [2 DAY] | [6 NIGHT; 5 DAY; 3 NIGHT; 4 DAY]
  4. 2 R → [1 DAY] | [2 NIGHT; 6 NIGHT; 5 DAY; 3 NIGHT; 4 DAY]
  5. 1 L → [4 NIGHT; 3 DAY; 5 NIGHT; 6 DAY; 2 DAY; 1 DAY]

Final stack: [4 NIGHT; 3 DAY; 5 NIGHT; 6 DAY; 2 DAY; 1 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA10 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 3 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 3 L → [1 DAY] | [2 DAY] | [4 NIGHT; 3 DAY] | [5 DAY] | [6 DAY]
  2. 2 L → [1 DAY] | [3 NIGHT; 4 DAY; 2 DAY] | [5 DAY] | [6 DAY]
  3. 2 L → [1 DAY] | [5 NIGHT; 3 NIGHT; 4 DAY; 2 DAY] | [6 DAY]
  4. 2 L → [1 DAY] | [6 NIGHT; 5 NIGHT; 3 NIGHT; 4 DAY; 2 DAY]
  5. 1 L → [2 NIGHT; 4 NIGHT; 3 DAY; 5 DAY; 6 DAY; 1 DAY]

Final stack: [2 NIGHT; 4 NIGHT; 3 DAY; 5 DAY; 6 DAY; 1 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA11 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 3 L. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 3 L → [1 DAY] | [2 DAY] | [4 NIGHT; 3 DAY] | [5 DAY] | [6 DAY]
  2. 4 L → [1 DAY] | [2 DAY] | [4 NIGHT; 3 DAY] | [6 NIGHT; 5 DAY]
  3. 3 R → [1 DAY] | [2 DAY] | [3 NIGHT; 4 DAY; 6 NIGHT; 5 DAY]
  4. 2 L → [1 DAY] | [5 NIGHT; 6 DAY; 4 NIGHT; 3 DAY; 2 DAY]
  5. 1 R → [1 NIGHT; 5 NIGHT; 6 DAY; 4 NIGHT; 3 DAY; 2 DAY]

Final stack: [1 NIGHT; 5 NIGHT; 6 DAY; 4 NIGHT; 3 DAY; 2 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

TA12 · Hints and full move sequence

Gentle hint: The last merge puts a fully reversed, face-switched packet on top of an unchanged packet. Look for a possible top/bottom split of the target before planning forward.

First-move hint: One valid plan starts with 2 R. Use the original six-packet starting row.

One complete solution: Each row below is a current-position move followed by the resulting left-to-right packet row. Within brackets, read top to bottom.

  1. 2 R → [1 DAY] | [2 NIGHT; 3 DAY] | [4 DAY] | [5 DAY] | [6 DAY]
  2. 2 R → [1 DAY] | [3 NIGHT; 2 DAY; 4 DAY] | [5 DAY] | [6 DAY]
  3. 3 L → [1 DAY] | [3 NIGHT; 2 DAY; 4 DAY] | [6 NIGHT; 5 DAY]
  4. 2 L → [1 DAY] | [5 NIGHT; 6 DAY; 3 NIGHT; 2 DAY; 4 DAY]
  5. 1 R → [1 NIGHT; 5 NIGHT; 6 DAY; 3 NIGHT; 2 DAY; 4 DAY]

Final stack: [1 NIGHT; 5 NIGHT; 6 DAY; 3 NIGHT; 2 DAY; 4 DAY]. Any other legal sequence giving this exact target also succeeds. Never renumber the slip identities; only the packet positions change.

The Remainder Pantry

JR01 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 36−A, A must be one of 2, 8, 14.

Stronger hint: The candidate amounts are A: 2, 8, 14; B: 4, 9, 14; C: 1, 5, 9, 13, 17. Choose one from each list totaling 36.

Solution: A=14, B=9, C=13. Stock: 14+9+13=36.

InspectionComplete arithmetic check
A+B23 = 4 × 5 + 3
B+C22 = 6 × 3 + 4
A+C27 = 5 × 5 + 2

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR02 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 30−A, A must be one of 6, 12, 18.

Stronger hint: The candidate amounts are A: 6, 12, 18; B: 4, 12; C: 1, 6, 11, 16. Choose one from each list totaling 30.

Solution: A=12, B=12, C=6. Stock: 12+12+6=30.

InspectionComplete arithmetic check
A+B24 = 5 × 4 + 4
B+C18 = 6 × 3 + 0
A+C18 = 8 × 2 + 2

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR03 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 24−A, A must be one of 4, 11, 18.

Stronger hint: The candidate amounts are A: 4, 11, 18; B: 8, 16; C: 2, 7, 12, 17. Choose one from each list totaling 24.

Solution: A=4, B=8, C=12. Stock: 4+8+12=24.

InspectionComplete arithmetic check
A+B12 = 5 × 2 + 2
B+C20 = 7 × 2 + 6
A+C16 = 8 × 2 + 0

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR04 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 25−A, A must be one of 7, 15.

Stronger hint: The candidate amounts are A: 7, 15; B: 4, 8, 12, 16; C: 7, 14. Choose one from each list totaling 25.

Solution: A=7, B=4, C=14. Stock: 7+4+14=25.

InspectionComplete arithmetic check
A+B11 = 7 × 1 + 4
B+C18 = 8 × 2 + 2
A+C21 = 4 × 5 + 1

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR05 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 42−A, A must be one of 3, 9, 15.

Stronger hint: The candidate amounts are A: 3, 9, 15; B: 4, 8, 12, 16; C: 5, 10, 15. Choose one from each list totaling 42.

Solution: A=15, B=12, C=15. Stock: 15+12+15=42.

InspectionComplete arithmetic check
A+B27 = 5 × 5 + 2
B+C27 = 6 × 4 + 3
A+C30 = 4 × 7 + 2

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR06 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 38−A, A must be one of 4, 10, 16.

Stronger hint: The candidate amounts are A: 4, 10, 16; B: 6, 13; C: 5, 10, 15. Choose one from each list totaling 38.

Solution: A=10, B=13, C=15. Stock: 10+13+15=38.

InspectionComplete arithmetic check
A+B23 = 5 × 4 + 3
B+C28 = 6 × 4 + 4
A+C25 = 7 × 3 + 4

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR07 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 33−A, A must be one of 1, 8, 15.

Stronger hint: The candidate amounts are A: 1, 8, 15; B: 5, 11, 17; C: 6, 14. Choose one from each list totaling 33.

Solution: A=8, B=11, C=14. Stock: 8+11+14=33.

InspectionComplete arithmetic check
A+B19 = 8 × 2 + 3
B+C25 = 7 × 3 + 4
A+C22 = 6 × 3 + 4

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR08 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 39−A, A must be one of 1, 8, 15.

Stronger hint: The candidate amounts are A: 1, 8, 15; B: 3, 7, 11, 15; C: 5, 13. Choose one from each list totaling 39.

Solution: A=15, B=11, C=13. Stock: 15+11+13=39.

InspectionComplete arithmetic check
A+B26 = 8 × 3 + 2
B+C24 = 7 × 3 + 3
A+C28 = 4 × 7 + 0

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR09 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 27−A, A must be one of 6, 14.

Stronger hint: The candidate amounts are A: 6, 14; B: 5, 12; C: 4, 9, 14. Choose one from each list totaling 27.

Solution: A=6, B=12, C=9. Stock: 6+12+9=27.

InspectionComplete arithmetic check
A+B18 = 5 × 3 + 3
B+C21 = 8 × 2 + 5
A+C15 = 7 × 2 + 1

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR10 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 29−A, A must be one of 3, 7, 11, 15.

Stronger hint: The candidate amounts are A: 3, 7, 11, 15; B: 3, 11; C: 1, 7, 13. Choose one from each list totaling 29.

Solution: A=11, B=11, C=7. Stock: 11+11+7=29.

InspectionComplete arithmetic check
A+B22 = 6 × 3 + 4
B+C18 = 4 × 4 + 2
A+C18 = 8 × 2 + 2

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR11 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 37−A, A must be one of 2, 7, 12, 17.

Stronger hint: The candidate amounts are A: 2, 7, 12, 17; B: 6, 14; C: 4, 8, 12, 16. Choose one from each list totaling 37.

Solution: A=7, B=14, C=16. Stock: 7+14+16=37.

InspectionComplete arithmetic check
A+B21 = 4 × 5 + 1
B+C30 = 5 × 6 + 0
A+C23 = 8 × 2 + 7

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.

JR12 · Hints and full allocation

Gentle hint: Look at B+C first. Because B+C = 35−A, A must be one of 1, 6, 11, 16.

Stronger hint: The candidate amounts are A: 1, 6, 11, 16; B: 4, 8, 12, 16; C: 2, 8, 14. Choose one from each list totaling 35.

Solution: A=11, B=16, C=8. Stock: 11+16+8=35.

InspectionComplete arithmetic check
A+B27 = 6 × 4 + 3
B+C24 = 5 × 4 + 4
A+C19 = 4 × 4 + 3

Every jar is between 1 and 18. This is the only ordered allocation satisfying every clue and the stock total.