Blacken some cells and draw a closed loop passing every white cell exactly once. The loop leads from the center of a cell to the center of a vertically or horizontally adjacent cell. It is allowed to blacken cells containing numbers, but black cells must not share an edge. There is no connected sequence of white cells in any row or column which extends to more than two regions. Numbers determine the number of black cells in the respective regions.
Solution code: For every row from top to bottom the length of the longest horizontal line.
on 31. May 2017, 16:46 by usp
Bilder wieder sichtbar gemacht
on 2. December 2015, 13:51 by usp
-typo
on 7. May 2014, 06:46 by kiwijam
Great idea!
on 4. May 2014, 22:11 by ibag
Wie erwartet: wunderschön!
on 24. April 2014, 19:13 by usp
@pin7guin: noch nicht, aber sicher bald :)
on 22. April 2014, 18:28 by pin7guin
Vielen Dank. Hat das Rätsel auch noch Geschwister? ;-)
on 22. April 2014, 07:39 by r45
Sehr schöner Lösungsweg. Dies ist eines der Rätsel, bei denen ich nach der Lösung noch lange darüber nachgedacht habe, wie es überhaupt funktioniert. Geniale Konstruktion.
on 22. April 2014, 02:25 by pwahs
@Joo M.Y:
Well, not exactly. This one has the additional Heyawake-rule of not looking through 3 regions in a row.
on 22. April 2014, 00:38 by Joo M.Y
Also known as 'Regional Yajilin'...