Locally Operating Globally Interconnected Computers
puzzle LOGIC(input):
Construction:
Write each word in the grid, one letter per space, starting at the triangles and proceeding in the indicated direction.
LIST(lover) | ▶ | |||||||||
▼ | EMPTY(frayed) | |||||||||
A | B | |||||||||
input | ▶ | |||||||||
C | A | |||||||||
CLUES(born) | ▶ |
The gray aᵢs and bᵢs in the original grid have been replaced with dotted lines and bold text. See original puzzle for specific values.
Deduction:
Ignore the gray aᵢs and bᵢs for now.
Solve as a NIKOJI:
- Divide the grid into regions along gridlines.
- Every region must contain exactly one letter.
- Regions with the same letter must have the same shape and orientation, with the letter in the same relative position.
- Regions with different letters may not have the same shape, even with rotation and/or reflection.
H | E | O | H | E | O | H | E | O | H | E | O | |||||||||||
L | L | L | L | L | L | L | L | |||||||||||||||
O | R | O | R | O | R | O | R | |||||||||||||||
W | L | D | W | L | D | W | L | D | W | L | D | |||||||||||
Example | Incorrect | Incorrect | Correct |
Extraction:
Let output be the empty string.
For each i from 1 to 11:
If aᵢ is not a border between two regions:
Append the letter from bᵢ’s region to output.