Logic Masters Deutschland e.V.

La Mer

(Published on 14. September 2025, 01:21 by sujoyku)

This puzzle has been set for Scojo’s Impostor Prompt this year. It was meant to represent my own style of setting as much as possible. Judge for yourself how well I managed to do so. The puzzle They’re Escaping, which it was up against, came from none other than the one and only Marty Sears.
I like to thank NEWS, Calvinball, MaizeGator and Palyfly Kampling for testing and thank Scojo, Hatgurl and Ratfinkz for organizing this amazing event. I wish you joyful solving!

Rules:

- 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 Lines: Box borders divide the blue lines into segments with the same sum. (Different lines may have different sums.)

- Up to N-sums: A clue outside the Row or Column N indicates the sum of all digits up to the cell that contains the digit N. (The digit N itself is not included in the sum.)

Here you can solve the puzzle online:

Solve on Sudokupad

Solution code: Row 4 from left to right (9 digits in total)


Solved by marty_sears, Scojo, tuturitu, sehringdipity, johnreid, MaizeGator, cryptique, gdc, chinesemaster, allama, Calvinball, TJ , zeniko, marajade, NEWS, QuiltyAsCharged, Crul, olegavibe, Snookerfan, ... Lorena, x3y2z1, opilla, miranda_9, drmegadude, Doc Liu, GabePuzzles, Astraeus, Senjo, jubengo, Vaurien, Silentdodo, GandalfLeRouge, Crusader175, Dester, Ton, W1n5t0n, trashghost, taissir, DD99
Full list

Comments

Last changed yesterday, 18:53

yesterday, 04:53 by Lorena
Debussy would be proud!

**
Thank you, Lorena!
Kind regards, sujoyku

Last changed on 15. September 2025, 20:22

on 15. September 2025, 20:06 by PancakePie
What a beautiful puzzle! Fun from start to finish. Thank you for this!

**
You are much welcome, PancakePie, thank you for your comment! I am glad you had a fun solve.
Kind regards, sujoyku

Last changed on 15. September 2025, 16:12

on 15. September 2025, 12:04 by mscha
Nice one! This is one of those puzzles where it seems like there's nowhere near enough information to solve it, but it just turns out to be enough.

**
Thank you for your comment, mscha! I am glad that you enjoyed the puzzle. I think I understand your experience. Some of the clues might have more impact than they initially appear to have.
Kind regards, sujoyku

on 14. September 2025, 22:02 by sujoyku
Many thanks for your kind comments, @chinesemaster, @QuiltyAsCharged, @Snookerfan, @meiwanmeiliao, @chubnatty and @Franjo! I am glad that you liked the puzzle.
Kind regards, sujoyku
//
Vielen Dank für Eure freundlichen Kommentare, @chinesemaster, @QuiltyAsCharged, @Snookerfan, @meiwanmeiliao, @chubnatty und @Franjo! Es ist schön, dass Euch das Rätsel gefallen hat.
Herzliche Grüße, sujoyku

Last changed on 14. September 2025, 21:36

on 14. September 2025, 21:32 by Franjo
Up-to-N ist natürlich verräterisch, doch könnte das eben deshalb auch ein Betrüger benutzen. Gut, dass ich nicht raten musste. Stattdessen durfte ich einfach beide Aufgaben in vollen Zügen genießen. Vielen Dank dafür!

on 14. September 2025, 18:22 by chubnatty
Really enjoyable logic, though my brain was fighting me for the first 10 minutes until I read the rules correctly. Found initial breakin straightforward, but then got stumped for a while. Such a satisfying hump to overcome, though! Thanks for a great puzzle!!

on 14. September 2025, 17:04 by meiwanmeiliao
翻译中文,然后看不懂,规则看不懂,这题目确实很难做了,完全不懂数字提示的规则…

on 14. September 2025, 13:18 by Snookerfan
Very nice! To get started maybe 3 stars difficulty, after that really smooth and indeed 2 stars. Thank you

on 14. September 2025, 11:47 by QuiltyAsCharged
Such an elegant puzzle!

on 14. September 2025, 04:59 by chinesemaster
Keep these up to n puzzles coming pls!!! Addicted to them!

Last changed on 14. September 2025, 01:52

on 14. September 2025, 01:30 by marty_sears
The worthy winner. Great puzzle mate, as smooth as usual

**
Thank you, Marty! I am glad you liked it.
Kind regards, sujoyku

Difficulty:2
Rating:96 %
Solved:114 times
Observed:1 times
ID:000P6C

Enter solution

Solution code:

Login