October game answer guide

LC01

One shortest solution: B → F → G. Minimum: 3 presses. Any ordering of this switch set reaches the same target.

LC02

One shortest solution: B → F → G. Minimum: 3 presses. Any ordering of this switch set reaches the same target.

LC03

One shortest solution: C → D → E → F. Minimum: 4 presses. Any ordering of this switch set reaches the same target.

LC04

One shortest solution: B → C → E → G. Minimum: 4 presses. Any ordering of this switch set reaches the same target.

LC05

One shortest solution: C → D → E → G. Minimum: 4 presses. Any ordering of this switch set reaches the same target.

LC06

One shortest solution: B → C → D → F → G. Minimum: 5 presses. Any ordering of this switch set reaches the same target.

LC07

One shortest solution: A → B → D → E → G. Minimum: 5 presses. Any ordering of this switch set reaches the same target.

LC08

One shortest solution: A → B → C → F → G. Minimum: 5 presses. Any ordering of this switch set reaches the same target.

LF01

Minimum: 5 journeys. One shortest route:

1. LEFT to RIGHT: B, P.
2. RIGHT to LEFT: B.
3. LEFT to RIGHT: A, B, Q.
4. RIGHT to LEFT: A, B.
5. LEFT to RIGHT: A, B, R, S.

LF02

Minimum: 7 journeys. One shortest route:

1. LEFT to RIGHT: A, P.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, Q.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: A, S.
6. RIGHT to LEFT: A.
7. LEFT to RIGHT: A, B, R.

LF03

Minimum: 7 journeys. One shortest route:

1. LEFT to RIGHT: A, Q.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, R.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: B, S.
6. RIGHT to LEFT: B.
7. LEFT to RIGHT: A, B, P.

LF04

Minimum: 7 journeys. One shortest route:

1. LEFT to RIGHT: A, Q.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, S.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: B, P.
6. RIGHT to LEFT: B.
7. LEFT to RIGHT: A, B, R.

LF05

Minimum: 7 journeys. One shortest route:

1. LEFT to RIGHT: A, Q.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, R.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: A, S.
6. RIGHT to LEFT: A.
7. LEFT to RIGHT: A, B, P.

LF06

Minimum: 7 journeys. One shortest route:

1. LEFT to RIGHT: B, Q.
2. RIGHT to LEFT: B.
3. LEFT to RIGHT: B, S.
4. RIGHT to LEFT: B.
5. LEFT to RIGHT: A, B, P.
6. RIGHT to LEFT: A, B.
7. LEFT to RIGHT: A, B, R.

LF07

Minimum: 9 journeys. One shortest route:

1. LEFT to RIGHT: A, B.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, P.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: A, Q.
6. RIGHT to LEFT: A.
7. LEFT to RIGHT: A, R.
8. RIGHT to LEFT: A.
9. LEFT to RIGHT: A, S.

LF08

Minimum: 9 journeys. One shortest route:

1. LEFT to RIGHT: A, B.
2. RIGHT to LEFT: A.
3. LEFT to RIGHT: A, P.
4. RIGHT to LEFT: A.
5. LEFT to RIGHT: A, R.
6. RIGHT to LEFT: B.
7. LEFT to RIGHT: B, Q.
8. RIGHT to LEFT: B.
9. LEFT to RIGHT: B, S.

SS01

Changed positions: 3, 8. Original sequence: 1 2 0 3 2 0 3 2.

The six original sums in printed order are 6, 9, 7, 6, 1, 7. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS02

Changed positions: 7, 8. Original sequence: 2 2 0 0 1 3 1 1.

The six original sums in printed order are 6, 3, 4, 1, 6, 6. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS03

Changed positions: 1, 8. Original sequence: 2 1 2 0 2 1 2 3.

The six original sums in printed order are 7, 6, 8, 5, 6, 6. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS04

Changed positions: 1, 4. Original sequence: 1 1 1 0 0 0 2 1.

The six original sums in printed order are 5, 2, 5, 5, 3, 1. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS05

Changed positions: 6, 8. Original sequence: 3 1 0 1 1 2 2 1.

The six original sums in printed order are 3, 5, 8, 6, 4, 8. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS06

Changed positions: 3, 8. Original sequence: 0 2 3 3 0 1 3 2.

The six original sums in printed order are 8, 8, 9, 4, 8, 6. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS07

Changed positions: 3, 4. Original sequence: 1 0 3 0 2 1 1 0.

The six original sums in printed order are 3, 7, 3, 4, 3, 4. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

SS08

Changed positions: 1, 6. Original sequence: 0 1 1 1 2 2 3 2.

The six original sums in printed order are 8, 5, 8, 3, 7, 6. Exhaustive checking of all 252 possible two-position replacements leaves this sequence alone.

TW01

Shortest completion: end of period 7. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW02

Shortest completion: end of period 6. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW03

Shortest completion: end of period 8. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW04

Shortest completion: end of period 8. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW05

Shortest completion: end of period 10. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW06

Shortest completion: end of period 7. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW07

Shortest completion: end of period 7. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

TW08

Shortest completion: end of period 8. One optimal schedule:

Every earlier horizon was searched and found infeasible. Other legal schedules at the same horizon count equally.

ND01

One complete plan: P: B → C → E → T; Q: A → D → E → T; R: S → A → C → T.

4 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND02

One complete plan: P: S → A → D → E → T; Q: A → C → E → T; R: A → C → T.

2 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND03

One complete plan: P: B → D → E → T; Q: S → A → C → E → T; R: B → C → T.

2 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND04

One complete plan: P: B → C → E → T; Q: B → C → E → T; R: A → C → T.

5 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND05

One complete plan: P: A → C → T; Q: B → C → E → T; R: A → C → E → T.

4 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND06

One complete plan: P: S → A → D → T; Q: A → D → T; R: B → D → E → T.

1 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND07

One complete plan: P: A → C → E → T; Q: B → C → E → T; R: B → D → T.

2 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

ND08

One complete plan: P: A → D → T; Q: A → C → T; R: S → A → C → E → T.

3 complete route combinations satisfy all printed conditions. Any one of them earns 2 points.

RR01

Unique ribbon: K K L K L L R L R.

Fragment start positions in printed order: 4, 3, 7, 1, 5. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR02

Unique ribbon: L L R K K K L R L.

Fragment start positions in printed order: 4, 1, 6, 7, 3. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR03

Unique ribbon: L L K K K L R R L.

Fragment start positions in printed order: 2, 7, 3, 5, 1. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR04

Unique ribbon: L L L K R K K L R.

Fragment start positions in printed order: 5, 3, 1, 7, 6. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR05

Unique ribbon: K L L L R K R L K.

Fragment start positions in printed order: 5, 2, 4, 1, 7. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR06

Unique ribbon: K K L K R L R L L.

Fragment start positions in printed order: 5, 3, 7, 2, 1. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR07

Unique ribbon: K K R L L L K L R.

Fragment start positions in printed order: 4, 7, 6, 1, 3. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

RR08

Unique ribbon: K L L K R L K L R.

Fragment start positions in printed order: 7, 3, 5, 1, 4. Positions are numbered from 1. There may be another valid occurrence of an individual fragment; the complete ribbon is unique.

LR01

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR02

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR03

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR04

Minimum: 6 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR05

Minimum: 8 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR06

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR07

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

LR08

Minimum: 4 exchanges. One shortest solution:

Tray letters are shown alphabetically for checking; their physical order never matters.

BB01

Unique weights: A=1, B=5, C=3, D=6.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB02

Unique weights: A=2, B=2, C=6, D=2.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB03

Unique weights: A=3, B=5, C=5, D=1.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB04

Unique weights: A=6, B=2, C=3, D=6.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB05

Unique weights: A=4, B=3, C=1, D=5.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB06

Unique weights: A=3, B=2, C=2, D=5.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB07

Unique weights: A=7, B=7, C=4, D=2.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

BB08

Unique weights: A=6, B=2, C=5, D=2.

All 2,401 allowed A/B/C/D tuples were checked. This is the only tuple satisfying every record.

TW01

Target: Alder. Report A permits Alder, Birch, Gorse, Hazel; report B permits Alder, Cedar, Elm. Their only common candidate is Alder.

TW02

Target: Alder. Report A permits Alder, Gorse; report B permits Alder, Cedar, Hazel. Their only common candidate is Alder.

TW03

Target: Alder. Report A permits Alder, Hazel; report B permits Alder, Cedar, Gorse. Their only common candidate is Alder.

TW04

Target: Birch. Report A permits Alder, Birch, Gorse, Hazel; report B permits Birch, Dahlia. Their only common candidate is Birch.

TW05

Target: Birch. Report A permits Birch, Dahlia, Hazel; report B permits Birch, Gorse. Their only common candidate is Birch.

TW06

Target: Birch. Report A permits Birch, Dahlia, Gorse; report B permits Birch, Hazel. Their only common candidate is Birch.

TW07

Target: Cedar. Report A permits Cedar, Elm; report B permits Alder, Cedar, Hazel. Their only common candidate is Cedar.

TW08

Target: Cedar. Report A permits Cedar, Elm, Fern; report B permits Alder, Cedar, Gorse. Their only common candidate is Cedar.

TW09

Target: Dahlia. Report A permits Birch, Dahlia, Gorse; report B permits Dahlia, Fern. Their only common candidate is Dahlia.

TW10

Target: Elm. Report A permits Elm, Fern; report B permits Alder, Cedar, Elm. Their only common candidate is Elm.

TW11

Target: Elm. Report A permits Cedar, Elm; report B permits Elm, Fern. Their only common candidate is Elm.

TW12

Target: Fern. Report A permits Elm, Fern; report B permits Fern, Hazel. Their only common candidate is Fern.

TW13

Target: Fern. Report A permits Cedar, Elm, Fern; report B permits Dahlia, Fern. Their only common candidate is Fern.

TW14

Target: Gorse. Report A permits Alder, Gorse; report B permits Birch, Gorse. Their only common candidate is Gorse.

TW15

Target: Gorse. Report A permits Birch, Dahlia, Gorse; report B permits Alder, Cedar, Gorse. Their only common candidate is Gorse.

TW16

Target: Hazel. Report A permits Alder, Birch, Gorse, Hazel; report B permits Fern, Hazel. Their only common candidate is Hazel.

TW17

Target: Hazel. Report A permits Birch, Dahlia, Hazel; report B permits Alder, Cedar, Hazel. Their only common candidate is Hazel.

TW18

Target: Hazel. Report A permits Alder, Hazel; report B permits Birch, Hazel. Their only common candidate is Hazel.

BT01

One working choice: A phase 1, B phase 3, C phase 6. Other choices may also work. Target: 0 / 1 / 0 / 2 / 0 / 0 / 2 / 1.

BT02

One working choice: A phase 0, B phase 2, C phase 5. Other choices may also work. Target: 2 / 0 / 1 / 0 / 2 / 1 / 0 / 0.

BT03

One working choice: A phase 2, B phase 0, C phase 4. Other choices may also work. Target: 1 / 0 / 1 / 2 / 1 / 0 / 2 / 0.

BT04

One working choice: A phase 3, B phase 6, C phase 1. Other choices may also work. Target: 1 / 1 / 2 / 1 / 0 / 1 / 1 / 0.

BT05

One working choice: A phase 4, B phase 1, C phase 7. Other choices may also work. Target: 0 / 1 / 1 / 1 / 1 / 3 / 0 / 1.

BT06

One working choice: A phase 5, B phase 2, C phase 0. Other choices may also work. Target: 2 / 0 / 2 / 1 / 0 / 1 / 1 / 1.

TE-R01

IN examples: 05, 06, 07, 08, 13, 14, 15, 16. OUT examples: 01, 02, 03, 04, 09, 10, 11, 12.

TE-R02

IN examples: 03, 04, 07, 08, 11, 12, 15, 16. OUT examples: 01, 02, 05, 06, 09, 10, 13, 14.

TE-R03

IN examples: 05, 06, 07, 08. OUT examples: 01, 02, 03, 04, 09, 10, 11, 12, 13, 14, 15, 16.

TE-R04

IN examples: 02, 04, 06, 08, 09, 10, 11, 12, 13, 14, 15, 16. OUT examples: 01, 03, 05, 07.

TE-R05

IN examples: 03, 04, 05, 06, 11, 12, 13, 14. OUT examples: 01, 02, 07, 08, 09, 10, 15, 16.

TE-R06

IN examples: 01, 03, 05, 07. OUT examples: 02, 04, 06, 08, 09, 10, 11, 12, 13, 14, 15, 16.

UA01

A paper tab showing which puddle supplied water for testing an umbrella.

UA02

A rack where spare keys hang beside drawings of their matching doors.

UA03

A wooden spoon used to point at orders during the café’s silent hour.

UA04

A promise to refill the next lantern after borrowing someone else’s light.

UA05

A set of tiny cards for marking the day’s weather inside a diary.

UA06

A meal served on separate steps while the dining room floor is drying.

UA07

Three neighbours who judge flower boxes from the opposite side of the street.

UA08

A reusable band marking tins that must be returned before the weekend.

UA09

A padded basket holding loose clock parts in the order they were removed.

UA10

A shallow tray where folded sheets wait before their covers are attached.

UA11

The brief rush of customers reclaiming hats when the last ferry arrives.

UA12

The moment stage lamps return after the first complete rehearsal in darkness.

UA13

A bent wooden marker showing where one gardener’s planting row pauses temporarily.

UA14

A card confirming that a household has cleared access to its attic hatch.

UA15

A serving plate with labels showing which biscuits contain each listed ingredient.

UA16

The final public reading of found items before they enter long term storage.

OS1-A

Requested answers: B1 = amber bell; B2 = linen flag; C3 = blue ribbon. One point per correct requested value.

OS1-B

Requested answers: C1 = wooden wheel; C2 = glass bead; D3 = stone cup. One point per correct requested value.

OS1-C

Requested answers: A3 = velvet spool; D1 = copper key; D2 = green pennant. One point per correct requested value.

OS1-D

Requested answers: A1 = paper bridge; A2 = brass button; B3 = silver comb. One point per correct requested value.

OS2-A

Requested answers: B1 = pebble crown; B2 = woollen map; C3 = silk leaf. One point per correct requested value.

OS2-B

Requested answers: C1 = clay whistle; C2 = marble boat; D3 = leather star. One point per correct requested value.

OS2-C

Requested answers: A3 = cotton kite; D1 = oak lantern; D2 = chalk flower. One point per correct requested value.

OS2-D

Requested answers: A1 = willow basket; A2 = tin feather; B3 = reed ladder. One point per correct requested value.

OS-ROUTE

One possible all-complete trading sequence for either market: Turn 1: A exchanges A3 for C3 with C. Turn 2: B exchanges B3 for D3 with D. Turn 3: C exchanges C1 for D1 with D. Turn 4: D exchanges C1 for A1 with A. Turn 5: B exchanges B1 for C1 with A. Turn 6: C exchanges C2 for B2 with B. Turn 7: D exchanges D2 for A2 with A. Turn 8: A exchanges D2 for B2 with C. This is a demonstration of feasibility, not required play. Several exchanges broker records learned earlier.