Nurimisaki 1
(Eingestellt am 3. Mai 2024, 18:53 Uhr von 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.
Lösungscode: Row 4 and column 6, using W for white cells, and S for shaded cells.
Zuletzt geändert am 4. Mai 2024, 11:44 Uhr
Gelöst von 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
Kommentare
am 31. Mai 2024, 12:35 Uhr von jessica6
Some parts are tricky. Definitely needed the all circles given rule to make progress.
am 4. Mai 2024, 11:46 Uhr von actinide
Thanks for the feedback ONeill, and for creating the penpa version.
am 4. Mai 2024, 11:44 Uhr von actinide
Clarified rules and added penpa link.
Zuletzt geändert am 4. Mai 2024, 02:20 Uhr
am 4. Mai 2024, 02:03 Uhr von ONeill
The rules should say that all circles are given.
penpa: https://tinyurl.com/2adzv28m
am 3. Mai 2024, 23:42 Uhr von actinide
First version had multiple solutions. Should be fine now.
