## Norinori

(Eingestellt am 26. November 2020, 03:00 Uhr von SudokuExplorer)

1. Colour black exactly two cells in each region.
2. Each black cell is orthogonally adjacent to exactly one other black cell.

See Nikoli link for an example. You can try this on PZV. Enjoy!

Lösungscode: The longest number of consecutive white cells in each row.

Zuletzt geändert am 26. November 2020, 04:13 Uhr

Gelöst von cdwg2000, Greg, athin, Eggr, karen_birgitta, Uhu, Jesper, dm_litv, CJK, zorant, Zzzyxas, Nothere, Grima, adam001, rimodech, Storm, ManuH, panthchesh, Kompetenzpartner, moss, ropeko, Semax, TimE, ... Joo M.Y, Bobby, rcg, MariaL, Swood, hurrdurr, Emad , jessica6, misko, sandmoppe, Matt, Max Euwe, Alex, Jaych, polar, BenceJoful, BMEP, fkil, GrabeR, Cane_Puzzles, Amuhn, Mark Sweep, Nusi, skywalker
Komplette Liste

### Kommentare

Zuletzt geändert am 2. Dezember 2020, 16:36 Uhr

am 28. November 2020, 08:12 Uhr von Lucx
Nice one - thank you!
---
Thanks Lucx! :-)

am 26. November 2020, 16:11 Uhr von SudokuExplorer
@panthchesh, @Storm & @Grima: I'm pleased you all enjoyed solving it, as much as I enjoyed setting it :-)

am 26. November 2020, 15:05 Uhr von panthchesh
Thanks this was fun! :)

am 26. November 2020, 14:34 Uhr von Storm
Very enjoyable logic :-)

am 26. November 2020, 12:14 Uhr von Grima
Loved this one!

am 26. November 2020, 04:13 Uhr von SudokuExplorer
Increased difficulty to 2-stars

Zuletzt geändert am 26. November 2020, 04:12 Uhr

am 26. November 2020, 03:41 Uhr von athin
Very nice! This is not level-1 difficulty tho imo.
---
Thanks athin! You are probably right. I recently saw a Norinori puzzle of 1-star difficulty (even though I found it more challenging) so I assumed other solvers found this an easy puzzle type. I'll increase it to 2-stars for now.

Zuletzt geändert am 26. November 2020, 04:09 Uhr

am 26. November 2020, 03:22 Uhr von cdwg2000
Thanks，My favorite way of breaking in.
---
Thanks, it means a lot coming from a more experienced Norinori solver. :-)

 Schwierigkeit: Bewertung: 90 % Gelöst: 61 mal Beobachtet: 0 mal ID: 0004SE

Lösungscode: