Logic Masters Deutschland e.V.

Artificer's Somewich

(Eingestellt am 26. April 2024, 00:41 Uhr von StartUp21)

Artificer's Somewich

What happens when you combine sandwich sums with somedokus?
I dunno, let's find out!


Rules:
  • Somedoku: Each cell contains one of the digits from 1-9. Every Nth row and every Nth column each contains N unique digits with the remaining ones being duplicates.
  • Minesweeper: Digits in a circle indicate the number of odd digits in its surrounding cells including itself. Additionally, shaded circles must contain odd digits.
  • Somewich sums: There are two types of somewiches:
    • a Single Somewich has the form [ H ] {. . .} [ L ] or vice versa;
    • a Double Somewich has the form [ H ] {. . .} [ L ] {. . .} [ H ] or vice versa.
    With H and L respectively referring to the highest and lowest digits in the associated region. (Row, column, or diagonal) The {. . .} digits may contain duplicates of H and L or any digit in the region.
    Clues outside the grid indicate the value of the sum of the {. . .} digits in the longest somewich in the region. Additionally, a clue in a square specifies the longest somewich is a Single, while a clue in a diamond specifies the somewich is a Double.
    (i.e 3 [2] {2 4 5 7 6 2} [7] is a Single Somewich with sum 2+4+5+7+6+2=26; 3 [7] {2 4 5} [2] {7 5} [7] is a Double Somewich with sums 2+4+5+7+5=23)

Play with Sudokupad

If you enjoyed the puzzle, please let me know in the comments or give a rating, or both!

Lösungscode: Column 6 from top to bottom

Zuletzt geändert am 26. April 2024, 00:44 Uhr

Gelöst von lmdemasi, SKORP17, ThePedallingPianist, ralphwaldo1, karlmortenlunna
Komplette Liste

Kommentare

am 20. Juni 2024, 00:38 Uhr von ralphwaldo1
Crusty!

am 26. April 2024, 02:21 Uhr von lmdemasi
Lovely puzzle. This definitely felt like one of the harder somedokus I have done.

am 26. April 2024, 00:44 Uhr von StartUp21
Fixed description

Schwierigkeit:3
Bewertung:N/A
Gelöst:5 mal
Beobachtet:7 mal
ID:000HU4

Rätselvariante Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden