Logic Masters Deutschland e.V.

Swanky Sandwiches [S-Cell Variant Sudoku]

(Published on 13. October 2022, 23:07 by wisty)

Every row, column, and region must contain a nonrepeating set of the digits 1-9. Every row and column must contain exactly one s-cell, which has two digits. All other cells, including givens, have one digit.

Thin lines each contain a nonrepeating set of consecutive digits. Both digits of an s-cell are included in the nonrepeating consecutive set.

Numbers outside the grid are sandwich clues, summing the digits placed between 1 and 9 in that row or column. 1 and 9 are *never* both on an s-cell. Any number accompanying a 1 or 9 on an s-cell is *always* included in the sandwich sum.

Play this puzzle on SudokuPad

Here is a chart of the possible sandwich sums included in this puzzle. Keep in mind that you can also find the sum of digits outside the sandwich by subtracting the sum from 35! :)

Thank you mnasti2 and Skunkworks (Brem, Crusader, DadJokes, fjam, Hoosier, Riff, Virtual, Xeon) for testing!

Solution code: rows 7 and 8 (no spaces) listing digits on s-cells starting with the lower of the two

Last changed on on 30. November 2023, 23:54

Solved by virtual, DadJokes, mnasti2, XeonRisq, riffclown, Eclectic_Hoosier, Bellsita, Myxo, damasosos92
Full list

Comments

on 3. December 2023, 01:31 by damasosos92
A perfect first S-cells puzzle if someone wants to start solving S-cells puzzles.

Last changed on 3. December 2023, 01:34

on 3. December 2023, 01:31 by Myxo
Funny puzzle :D A good execution of anti-telegraphing.
__________________________

How can I pin this comment
-wisty

on 21. October 2022, 18:08 by riffclown
I don't usually do S-Cell but this was a good experience for me.

Last changed on 14. October 2022, 00:19

on 14. October 2022, 00:19 by DadJokes
Wonderful puzzle! This was my first ever introduction to S-cells and a great one it was. Tons of little tricks that get resolved by great logic. Loved it!

Difficulty:4
Rating:N/A
Solved:9 times
Observed:3 times
ID:000BMI

Puzzle variant

Enter solution

Solution code:

Login