Combi Block #2: L Trominoes
(Eingestellt am 14. August 2021, 16:27 Uhr von Aspartagcus)
RULES:
Divide the grid in regions such that:
- each region only contains two full blocks (as delimited by the dotted lines).
- no region has a rectangular shape.
- no orthogonally connected regions have the same shape (reflections and rotations included).
Rules and example on puzz.link
Enjoy!
Link to solve it online:
puzz.link
Lösungscode: The number of shape segments in each row, from top to bottom. If multiple segments of the same shape appear in the same row, each segment is counted on its own.
Kommentare
am 28. April 2023, 11:41 Uhr von CHalb
@hopppe: Du sollst beim Lösungscode jedes Gebietssegment einzeln zählen.
am 8. September 2021, 18:15 Uhr von XoZu
I love everything about this, including the solution code!
am 18. August 2021, 22:04 Uhr von Aspartagcus
Added tag
am 16. August 2021, 12:02 Uhr von CHalb
I hadn't seen this puzzle type before and I definetely like it. Thanks a lot for introducing it here with this two characterful puzzles :-) .
----
Glad to hear that, I found it quite fun the first time I saw it myself. I put up a third one as well. :)
am 16. August 2021, 10:06 Uhr von Aspartagcus
Updated solution code description and changed difficulty.
am 15. August 2021, 19:25 Uhr von Voyager
@SudokuExplorer: Thanks a lot for your imho very important hint in an open comment! I had the same problem as you some hours ago, and now I will solve the puzzle again to put the code.
am 15. August 2021, 17:57 Uhr von SudokuExplorer
Initially I misread the solution code to be the number of shapes per row (like in the previous puzzle). :-(
Then I misread it to be the number of vertical line segments. Luckily I only needed to add one this time, to get the right code.
I recommend keeping the solution code description consistent for all your puzzles of this puzzle type. I enjoyed the actual puzzle and the thematic layout :-)
----
Sorry about that, I didn't have this issue in the first one. I'll make it clearer and make them the same.
Thanks for solving, and for the feedback! :)
Edit #2: Also, congrats on being featured on CTC today!
