Erratic U-Bahn
(Published on 13. June 2025, 09:00 by Agent)
Draw a loop network through the centers of some cells, which may branch or turn, but may not have any dead ends.
Letters from A to J are assigned to the digits 0 to 9 once each. Each clue represents one of the neighboring letters in the alphabet, and the digit assigned to that neighbor must be one more or one less than the number of occurrences of the corresponding line shape (i.e. a cross, branch, straight line, or turn) in the corresponding row or column, irrespective of the line shape's rotation.
For example, if the letters A and C are assigned to the digits 1 and 6 in some order, then a B-clue indicates that there are either 0, 2, 5, or 7 occurrences of the corresponding line shape in the corresponding row or column. To clarify, A and J are not neighbors.
Solution code: For each row except the last, from top to bottom, the number of lines leading down from that row.
Comments
on 20. June 2025, 11:51 by Piatato
Awesome puzzle!
on 17. June 2025, 12:19 by cyddrdrd
Learning new techniques when solving this. Really difficult but so awarding! Thanks Agent!
on 17. June 2025, 03:33 by askaksaksask
A tricky start, but well worth wading through the offset cipher...a very rewarding finish that really picked up some fun momentum towards the end. At first I wondered if the clue-cipher- neighbor offset was just for added difficulty, but in fact it led to some really rich deductions and in retrospect, I think, really made the puzzle what it is. So clever. Again, a blast. Thank you!!
on 15. June 2025, 18:52 by Jesper
Fantastic puzzle, thanks!
on 15. June 2025, 17:43 by Playmaker6174
Awesome and somewhat wonderful puzzle! For such a cursed theme like this, the solve path actually felt well telegraphed throughout and I only had to scratch my head at couple of points to get the next step :)
on 15. June 2025, 03:51 by wisty
Really funny puzzle full of neat deductions, thanks!
on 15. June 2025, 00:41 by Myxo
Amazing puzzle!
on 13. June 2025, 17:00 by sfushidahardy
Really cool and amazing puzzle! I mostly solved this on paper. Somehow it wasn't as brutal as I expected from the ruleset.
