U-Bahn LITSO (Again)
(Eingestellt am 19. November 2024, 19:57 Uhr von the_cogito)
Well, this might seem like deja vu for some of you. I recently published a puzzle with the same title, but which had a potential issue brought to my attention. After some quick investigation, I ultimately decided to deactivate that puzzle while I searched for a fix. Well, it became apparent to me no quick fix would present itself, as there were some underlying assumptions I made in the break-in that were simply incorrect. So I decided to just try setting it again from scratch :D
I truly apologize to anyone who invested a lot of time on the previous version of this to no avail. That said, this is, I think, a cleaner, more enjoyable puzzle overall, so I hope you're willing to give it a try. I hope you like it!
Rules:
- Draw a totally connected loop network through the centers of some cells, which may branch or turn, but may not have any dead ends. A clue outside the grid indicates how many times the corresponding line shape (i.e. a cross, branch, straight line, or turn) appears in the corresponding row or column, irrespective of the line shape's rotation.
- Divide the grid into non-overlapping tetrominoes such that every cell is part of a tetromino. Orthogonally adjacent tetrominoes may not be the same shape, regardless of rotation or reflection.
- The loop network must cross the perimeter of every tetromino exactly 3 times.
The puzzle:
Solve on Penpa (Includes answer check for the loop only)
Solve on Sudokupad (No answer check)
The five standard tetrominoes, ignoring rotation and reflections:
Lösungscode: From the top down, for every row except the bottom row, the number of loop segments extending down from that row.
Zuletzt geändert am 20. November 2024, 17:07 Uhr
Gelöst von Samish, Paletron, Jesper, SeveNateNine, ONeill, roflsalot, SnapDragon, lmdemasi, Mr_tn
Kommentare
am 2. Dezember 2024, 09:54 Uhr von roflsalot
brutal, but fun!
Zuletzt geändert am 1. Dezember 2024, 03:56 Uhram 29. November 2024, 13:08 Uhr von hepcecob
Sorry for spoiling the puzzle :)
------
All good, I'm glad you found it before it got even more attempts!
am 23. November 2024, 16:42 Uhr von Jesper
Cool puzzle! Not easy, but ultimately very rewarding :)
am 19. November 2024, 21:49 Uhr von Samish
Wonderful puzzle, it's really fantastic to figure out all the implications this simple ruleset has. One of my favourite puzzles in recent times!