Nurimisaki 1
(Published on 3. May 2024, 18:53 by actinide)
Classic nurimisaki rules apply: Shade some cells of the grid with the following constraints:
- No 2x2 area is fully shaded or fully unshaded.
- All unshaded cells form a single orthogonally-connected area.
- All circles are unshaded.
- A cell with a circle has only one non-shaded orthogonally-connected neighbor.
- A number in a circle indicates how many unshaded cells are seen from that cell in a straight line, including itself.
- All possible circles are given.
Solution code: Row 4 and column 6, using W for white cells, and S for shaded cells.
Last changed on on 4. May 2024, 11:44
Solved by ONeill, Jesper, Franjo, CJK, Lizzy01, Mark Sweep, Uhu, bernhard, puzzler05, KNT, JustinTucker, Dandelo, saskia-daniela, Raistlen, louie.lly, Greg, rubbeng, Rollo, misko, CHalb, SPREVVIE, jessica6, ManuH
Comments
on 31. May 2024, 12:35 by jessica6
Some parts are tricky. Definitely needed the all circles given rule to make progress.
on 4. May 2024, 11:46 by actinide
Thanks for the feedback ONeill, and for creating the penpa version.
on 4. May 2024, 11:44 by actinide
Clarified rules and added penpa link.
Last changed on 4. May 2024, 02:20
on 4. May 2024, 02:03 by ONeill
The rules should say that all circles are given.
penpa: https://tinyurl.com/2adzv28m
on 3. May 2024, 23:42 by actinide
First version had multiple solutions. Should be fine now.
