Logic Masters Deutschland e.V.

Dual Citizen Series #1 - Dual Citizen

(Eingestellt am 19. Februar 2023, 19:43 Uhr von Mikemerin)

Part of the Dual Citizen Series

This is a new ruleset I thought of to get more than 9 regions in a normal 9x9 grid. This puzzle is the proof of concept, with more to come.

Please note that the conflict checker will not work properly as I cannot currently define multiple regions in a single cell.


---

Each row, column, and each of the 10 regions must contain the digits 1 to 9. If a number is on a diagonal line, it is a part of two different regions.

---

Solve in Sudokupad (includes solution) or Penpa+ (includes solution)

Lösungscode: All 9 dual citizens in reading order (left to right, going down each row)


Gelöst von Niverio, OutOfMyMindBRB, AlSina, Fisherman, hige, Fw1728, Zyphix, Harold, SKORP17, Onkel_Dagobert, Arlo Lipof, Jlrice2, AvonD, ClashCode, dodomos, MicroStudy, jalebc, dskaff, rockratzero, jchan18, wilsig, Raistlen, Greg, saskia-daniela, Ragna, kjholt, Banana, gumby, OGRussHood, Uhu, ManuH, Martini&Toto, sof, zorant, PippoForte, zrbakhtiar, MineLenny, PunkAssNumberBoy, sockerbecca
Komplette Liste

Kommentare

Zuletzt geändert am 22. Februar 2023, 15:34 Uhr

am 21. Februar 2023, 16:25 Uhr von Ragna
Very nice idea! Thank you for sharing. :-)

--

Of course! Looking forward to expanding on this idea -MM

Zuletzt geändert am 20. Februar 2023, 18:30 Uhr

am 20. Februar 2023, 07:41 Uhr von rockratzero
It's an interesting intro to the concept. Will be looking forward to seeing how far it can be pushed :)

--

Thanks! I have an easier one I'm almost done with, and a harder one coming after that. Definitely have a go at making one if you can, I remember your lasso puzzle, something like that combined with a diagonal would be fun. -MM

Zuletzt geändert am 20. Februar 2023, 04:06 Uhr

am 19. Februar 2023, 21:34 Uhr von Fisherman
A beauty.

--

Thanks! -MM

Schwierigkeit:2
Bewertung:84 %
Gelöst:39 mal
Beobachtet:8 mal
ID:000D0O

Rätselvariante Neu Unregelmäßiges Gitter

Lösung abgeben

Lösungscode:

Anmelden