Logic Masters Deutschland e.V.

All Dots Within a Region...

(Published on 23. April 2025, 14:35 by Md88keys)

All Dots Within a Region...

by Md88keys

 

Play in Sudokupad

 

 

 

Choose a set of six digits from 1-9 and fill the irregular sudoku so each of the selected digits appears once in every row, column, and marked region.

Kropki dots: Black dots indicate cells with a 2:1 ratio. White dots indicate cells with consecutive digits.

Negative constraint: All dots within a region are given.

Note: If it occurs in the grid, within a region, a pair of 1-2 will be marked with either a black or white dot.

Solution code: Row 6


Solved by gdc, PinkNickels, Fenners, Chilimy, kyuquu, tgstar, OutOfMyMindBRB, RickiFerrara, Greg, unlogical, ccotreau, MartinR, VykkDraygo, jalebc, Garizon, Philologos, Javier Rebottaro, tuturitu, XhcnoirX, ... Thomster, vidarino, ringel, tinkerer, Calesch, iamlequebecois, geronimo92, Airelin, Terrapin, podingo, taco.bella, ValentineQuinn, jjtheplum, timww572, snowflake, Baconator, TagEule, setofwords
Full list

Comments

on 12. June 2025, 00:31 by kopo1
Wow! What a puzzle! Very nicely set. One of the nicest puzzle I've ever solved.

on 1. May 2025, 07:09 by Md88keys
Thank you Adelaide for the suggestion.
A 9*9 Sequel is now available to solve!

on 29. April 2025, 05:35 by adelaide
simple but clever; a pretty puzzle with a fun rule set -- I'd love to see a 9x9 or even a chaos construction with a similar idea

on 24. April 2025, 06:24 by TheKyoshiroFan
Really enjoyed the logic on solving this.

on 23. April 2025, 17:45 by dingledork
I really enjoyed this, thank you!

on 23. April 2025, 16:51 by Sparky
Very fun one, thank you !

on 23. April 2025, 16:41 by JonnyKaufman
This was such a well-set use of the constraints, thanks!

on 23. April 2025, 16:26 by Garizon
Proof that a puzzle doesn’t have to be difficult to be elegant. Well set.

on 23. April 2025, 15:16 by kyuquu
very nice usage of the negative constraint!

on 23. April 2025, 14:56 by PinkNickels
Thanks for a fun one!

Difficulty:1
Rating:94 %
Solved:211 times
Observed:6 times
ID:000N1C

Enter solution

Solution code:

Login