Babbling Brook
(Eingestellt am 8. September 2023, 05:30 Uhr von Knickolas)
Yin Yang: Shade the grid using two colors, such that all instances of each color are orthogonally connected, and no 2x2 area is completely one color.
Sum Lines: Blue lines must have an equal sum N within each color they pass through. If a blue line passes through a color multiple times, each individual pass sums to N. All lines must cross colors at least once.
X: Digits seperated by an X sum to 10.
I hope you enjoy!
Lösungscode: Row 5
Kommentare
am 15. September 2023, 02:10 Uhr von RubberMittens
Great puzzle. I kept getting stuck in the beginning because I thought N was the same for all sum lines. I might suggest adding some clarity to the instructions to make it clear that "not all sum lines necessarily add up to the same sum" or something.
am 10. September 2023, 23:09 Uhr von GemmaOane
Bloody lovely puzzle but I did have some problemns understanding the rules at first! Thanks
am 8. September 2023, 23:38 Uhr von yttrio
Fantastic puzzle!
am 8. September 2023, 20:19 Uhr von Florian Wortmann
Very fun!
am 8. September 2023, 19:34 Uhr von jhow25
Loved it. Thanks for posting. The break-in was cute.
am 8. September 2023, 13:37 Uhr von by81996672
Fun puzzle, Maybe solver need to have some confidence in your own judgment
am 8. September 2023, 11:52 Uhr von ThibautV
Is N the same for all lines?
——
No, each line has its own value N.
