Logic Masters Deutschland e.V.

X-Sums and Sandwiches

(Eingestellt am 17. August 2025, 14:01 Uhr von RockyRoer)

When I created Skyscraper Sums Sandwiches a while ago, it occurred to me that I hadn't yet mixed my favorite two variants together, so here you go:

The Rules:

  1. [Sudoku] Normal sudoku rules apply - fill every row, column, and 3x3 box with the digits from 1 to 9 once each.
  2. Clues outside the grid are simultaneously sandwich clues, and x-sum clues (i.e. if the sandwich clue is 13, then the x-sum clue must also be 13) A single question mark must be a one digit number and a double question mark must be two digit number (no leading zeros).
    • [Sandwich]: The sum of the digits between the 1 and the 9 in that row or column.
    • [X-Sums:] The sum of the the first x cells in that row from the direction of the clue where x is the digit in the cell next to the clue.

The Puzzle:

Four solving options for you:

Lösungscode: The row, or column, with the largest sandwich total, either from left to right, or top to bottom. This may or may not be one of the rows/columns marked with a clue. (9 digits)


Gelöst von zeniko, jalebc, SKORP17, Franjo, marcmees, tuturitu, Exigus, giladooshlon, jinkela114514, ole-1995a, ch1983, KlausRG
Komplette Liste

Kommentare

am 18. August 2025, 12:19 Uhr von Exigus
Tricky but fair. Thanks!

am 17. August 2025, 22:22 Uhr von marcmees
Very nice, fun till the end. Approachable, but with care. Thanks

am 17. August 2025, 19:19 Uhr von Franjo
I refused the guided tour - and ran into problems. Caused by myself, of course. Looking back on my path the right way seems so clear and beautiful! Thank you very much for creating and sharing another incredible math sandwich.

am 17. August 2025, 15:25 Uhr von zeniko
That‘s another nice empty grid leading to a pleasantly tricky solve path. I got stuck twice and only at the end realized, that for that case you‘ve even been so kind to add a guided variant. Thanks for sharing.

Schwierigkeit:4
Bewertung:85 %
Gelöst:12 mal
Beobachtet:1 mal
ID:000OQU

Lösung abgeben

Lösungscode:

Anmelden