U-Bahn with Empty Clues (4)
(Eingestellt am 28. Juli 2023, 15:50 Uhr von KNT)
This is the final and most difficult of these puzzles.
Rules:
Draw a totally connected loop network that travels through the centers of some cells. The loop network has no dead ends.
A clue outside the grid indicates in how many cells the corresponding behavior (turn, straight, branch, cross, or unvisited) occurs in the row or column.
After creating the puzzle, I replaced five numbers with the letters from A to E. The rest of the numbers I left as question marks.
The puzzle follows:
Lösungscode: For each column besides the last, the number of lines leading right from that column
Kommentare
am 20. März 2024, 18:02 Uhr von The Book Wyrm
Incredible puzzle.
Took me a while, especially because I broke it a couple times at the start due to overlooking options. Very hard deductions all the way through; even at the end, you have to work for very single deduction (I did, at least).
Lots of very interesting and complex logic thoughout. Extremely impressive puzzle.
The logic surrounding the ? clues, and how the were able to resolve stuff despite the only restrictions on them being a few numbers they couldn't be was very interesting. Really liked that.
Thanks for the puzzle!
am 6. November 2023, 05:12 Uhr von wisty
Holy cow, that was long. Great puzzle! Really fun and memorable first half, followed by an intricate and jaw-droppingly thorough examination of the genre in the second half. I absolutely loved it, but it was also probably the most time I've spent on a puzzle so far since picking up this hobby. There are definitely a couple spots that I suspect I over-complicated though. I'm the type of solver who really enjoys doing so anyway, since I feel I unlocked a full understanding of what the clues are doing, but I'm certain there is a very clean (albeit narrow) solve path overall. KNT, take a bow!
am 18. Oktober 2023, 07:54 Uhr von Gliperal
Diabolical.
am 29. September 2023, 21:31 Uhr von Jesper
An epic puzzle!
I got properly stuck on my first attempt, but this time, thankfully, I spotted the deduction that evaded me last time :)
am 14. September 2023, 15:24 Uhr von ibag
Finally! I can't remember the last time it took me so long to solve one single puzzle. Great!
am 9. September 2023, 00:37 Uhr von Niverio
Absolute insanity, why would anyone even set this puzzle, do they want their solvers to die
am 2. September 2023, 02:27 Uhr von Agent
Wonderful puzzle! The solution path was utterly relentless, but equally rewarding. A beautiful proof that U-Bahn logic can be extremely rich (and also extremely hard).
am 2. September 2023, 00:46 Uhr von wand
a wild journey. stuck for nearly all of august in the middle before inspiration from other u-bahns and wooferzfg's tutorial struck. really enjoyed it!
am 23. August 2023, 23:09 Uhr von chalk235
Beautiful puzzle! I needed to read wooferzfg’s ubahn document a few times to have any chance of solving this. Doing this puzzle felt a bit ike reading Lord of the Rings for the first time - both thrilling and exhausting!
am 19. August 2023, 11:56 Uhr von lupo
Wow :-)
am 31. Juli 2023, 20:20 Uhr von KNT
@Luigi: No information is given in hint fields with no symbol (letter or ?). But no given ? may have any of the values you have deduced.
am 29. Juli 2023, 22:49 Uhr von Myxo
Awesome, really challenging puzzle!
am 29. Juli 2023, 19:57 Uhr von ONeill
Very nice and difficult :) A lot of the deductions were new territory for me. Thanks!
am 29. Juli 2023, 06:30 Uhr von Koalagator2
Brutally difficult puzzle although part of that is due to my inexperience with U-Bahn. Overall, very fun.
am 29. Juli 2023, 05:42 Uhr von Piatato
I greatly enjoyed the first 30 minutes, which went very smoothly for me. Then I was thoroughly schooled for the next 10 hours. In the end my brain was brutalized so horribly that I spent two hours on the relatively easy last deduction. I hope that I'll recover, so that I can use the things I have learned. Tremendous puzzle!
am 28. Juli 2023, 22:49 Uhr von wooferzfg
@Koalagator2 Yes to both questions: The values of the ?s cannot be any of A-E, and A-E are all different numbers (not digits, so they're allowed to be more than 9)
am 28. Juli 2023, 18:09 Uhr von polar
Awesome puzzle, thanks!
am 28. Juli 2023, 17:11 Uhr von wooferzfg
Solving this was a really challenging and very fun experience, which tested every corner of my U-Bahn knowledge.
