Solution code: For every row except the last, from top to bottom, the number of line segments extending down from that row.
on 24. November 2025, 19:49 by cyddrdrd
Wow! What a journey!
on 18. January 2025, 22:17 by ONeill
really cool idea and execution, thanks!
on 17. January 2025, 21:39 by Christounet
Thank you so much again for this wonderful gift ! I was honored to be your victim. Masterful construction, gathering everything I enjoy about U-Bahn, encoded clues, with a great variety of global and local deductions. And miraculous too ! I am still amazed it was possible to get such an elegant grid with that super restrictive ruleset. Take a bow, Satan !
| Difficulty: | ![]() |
| Rating: | N/A |
| Solved: | 9 times |
| Observed: | 1 times |
| ID: | 000LNK |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.