Bäume im Herbst: Masyu
(Published on 4. November 2019, 08:00 by ibag)
Draw a single, non-intersecting loop that passes through all circled cells. The loop must go straight through the cells with white circles, with a turn in at least one of the cells immediately before/after each white circle. The loop must make a turn in all the black circles, but must go straight in both cells immediately before/after each black circle.
Solution code: For each column from left to right, the number of vertical path segments (= number of bends divided by 2).
Last changed on on 4. November 2019, 21:14
Solved by Statistica, lupo, zuzanina, CHalb, jessica6, Joe Average, matter, marcmees, flaemmchen, jirk, rimodech, moss, cornuto, Nothere, dm_litv, saskia-daniela, ch1983, r45, karzym, Matt, Uhu, Zzzyxas, ... rcg, marsigel, Laje6, athin, AndreasS, Raistlen, misko, Thomas Meier, Nusi, Saskia, PixelPlucker, Jesper, Dugong, hopppe, jodid, garganega, Dotty, Echatsum, moeve, chrisbee2, KNT, RobertBe
Comments
on 8. November 2019, 23:58 by Uhu
@Rollo: Eine Ziffer im LC ist falsch eingegeben, die Lösung stimmt
on 4. November 2019, 08:43 by lupo
Da steht ja WPC drin, wie schön :-)
