Logic Masters Deutschland e.V.

Every Pea, Every Screw (with sujoyku)

(Eingestellt am 30. Mai 2025, 15:44 Uhr von SamuPiano)

sujoyku and I have teamed up once again! This time we have combined our beloved split pea lines with a twist on Gerhard1963's region sum screws.

The title is a reference to the Placebo song "Every Me, Every You." We hope you enjoy it!

Rules:
Sudoku: Normal sudoku rules apply, i.e. each row, column, and 3x3 region has to contain the digits from 1 to 9 once each.
Region Sum Screws (variant): Box borders divide the blue lines into segments. Segments with a black screw between them have a n:1 ratio, i.e. one of the segments sums to n times the other, where n is an integer (to be determined by the solver). No two black screws may have identical ratios.
Split Pea Lines: Digits on a line between two circles sum to a two-digit number written using the digits in the circles. For example, 3_346_1 could be a valid split pea line, as 3+4+6=13, which is 1 concatenated with 3.

Click the image of the puzzle to play!

Happy solving! Please leave a comment and check out some of our other puzzles if you enjoyed this one!

Lösungscode: Row 8, from left to right (9 digits).

Zuletzt geändert -

Gelöst von sujoyku, NEWS, ChinStrap, mellowrobinson, mathpesto, kroutu, Jesper, Snookerfan, Bankey, MattYDdraig, SKORP17, marcmees, ThePedallingPianist, giladooshlon, karlmortenlunna, Scojo, aqjhs, bansalsaab, ... zeniko, Crusader175, palpot, Clara123, pazqo, wenchang, mse326, nguyenhaoqn3, sunevora, flyjim, kevinlimanta, feverlute, crosslegged, joelth, sorryimLate, tuoni2, psych, Kellyflaps, Bathroomking
Komplette Liste

Kommentare

Zuletzt geändert am 31. Mai 2025, 14:21 Uhr

am 31. Mai 2025, 13:58 Uhr von Franjo
Amazing puzzle! Unscrewing the SP-lines was so entertaining and not thar hard (3* from me). Thank you very much for creating and sharing.
--
Thank you for your kind comment, Franco! Sujoyku and I are so happy you enjoyed the puzzle. -SP

Zuletzt geändert am 30. Mai 2025, 23:50 Uhr

am 30. Mai 2025, 23:28 Uhr von avishai
What a joy! I despaired at first, but with some perseverance (and a calculator), everything unfolded so fairly and smoothly. Thank you both so much!
--
Thank you for your kind comment, avishai! We are glad you enjoyed our puzzle. -SP

Zuletzt geändert am 30. Mai 2025, 21:47 Uhr

am 30. Mai 2025, 18:42 Uhr von MattYDdraig
Beautiful puzzle and incredible how quickly the limitations close down options here.
--
Thank you for your words, MattYDdraig! We were ourselves surprised and happy at some of the implications of this ruleset, and we're happy you thought the same! -SP

Zuletzt geändert am 30. Mai 2025, 21:46 Uhr

am 30. Mai 2025, 18:42 Uhr von Bankey
Fun puzzle. Thanks, @ SamuPiano and @ sujoyku :).
--
Thank you for your kind comment, Bankey! We are glad you thought the puzzle was fun. -SP

Zuletzt geändert am 30. Mai 2025, 21:45 Uhr

am 30. Mai 2025, 18:17 Uhr von Snookerfan
Great puzzle! It took me ages to look in the right spot, my fault. Lovely and smooth solvepath when you don't make that mistake. Thank you
--
Thank you for your kind comment, Snookerfan! We are glad you had a smooth solve (once you picked the right starting point). -SP

Zuletzt geändert am 30. Mai 2025, 21:44 Uhr

am 30. Mai 2025, 16:05 Uhr von NEWS
Thank you for the masterpiece!
Vielen dank für das Meisterwerk!
--
Thank you for your kind comment, NEWS! We are glad you enjoyed the puzzle. -SP

Zuletzt geändert am 30. Mai 2025, 21:43 Uhr

am 30. Mai 2025, 16:02 Uhr von ChinStrap
Really nice use of the constraint and global disjoint condition here. Every deduction felt so intentional and tightly set.
--
Thank you for streaming your solve, even if I couldn't be there at the time! It was a joy to watch it back. Thank you also for your kind words! -SP

Zuletzt geändert am 30. Mai 2025, 21:42 Uhr

am 30. Mai 2025, 16:00 Uhr von sujoyku
Thank you for this fun collab, SamuPiano! It is always a pleasure to set with you.
--
It was a pleasure as always! Thank you for being willing to collaborate :) -SP

Schwierigkeit:4
Bewertung:97 %
Gelöst:47 mal
Beobachtet:8 mal
ID:000NLC

Lösung abgeben

Lösungscode:

Anmelden