Wichtel 2015 (2): Doppelstern-Yajilin
(Published on 18. March 2016, 15:02 by wichtel)
To Christmas 2015 some eager puzzlefriends have again arranged a group in which everybody had to make anonymously a puzzle for someone else. These puzzles are now presented one after the other here in the portal.
The chief gnome wants to send a christmas greeting to his puzzle comrades who have been active this year. He grabs a lower hierarchy gnome and orders him to deliver the greetings:
"Here you have a map: In each area a gnome has his house star an his puzzle making workshop star. You have to find the positions of the stars. We know, that the stars do not touch each other, not even diagonally, and there are exactly two stars in each row and column. Since I do not know, where the gnomes are at the moment, you have to locate all stars.
The blue hint cells show you, how many stars you find in the direction of the arrow. Your loop has to go orthogonally from cell to cell through all cells without hint or star.
Oh, I mustn't forget to tell you: On the map are three christmas bakeries, shown as read edges. Of course you can't go through the bakeries. Now make haste, there's not much time left."
The chief gnome wants to send a christmas greeting to his puzzle comrades who have been active this year. He grabs a lower hierarchy gnome and orders him to deliver the greetings:
"Here you have a map: In each area a gnome has his house star an his puzzle making workshop star. You have to find the positions of the stars. We know, that the stars do not touch each other, not even diagonally, and there are exactly two stars in each row and column. Since I do not know, where the gnomes are at the moment, you have to locate all stars.
The blue hint cells show you, how many stars you find in the direction of the arrow. Your loop has to go orthogonally from cell to cell through all cells without hint or star.
Oh, I mustn't forget to tell you: On the map are three christmas bakeries, shown as read edges. Of course you can't go through the bakeries. Now make haste, there's not much time left."
Solution code: For each row from top to bottom the number of bends in the path
Last changed on -
Solved by tuace, ch1983, rcg, Luigi, flaemmchen, cornuto, Babsi, moss, dm_litv, derwolf23, rob, zorant, pokerke, r45, pin7guin, zuzanina, ibag, Rollo, pirx, lutzreimer, Alex, Mody, ManuH, CHalb, Thomster, ... RobertBe, rimodech, Mathi, amitsowani, NikolaZ, zhuyunxuan, AndreasS, Krokant, Realshaggy, uvo, Julianl, athin, misko, Raistlen, Dugong, Mark Sweep, CJK, hopppe, KNT, The Book Wyrm, Titatovenoor
Comments
on 2. March 2023, 21:29 by NIGHTCRAULER
Link to penpa+: https://tinyurl.com/jx53u8yw
