Logic Masters Deutschland e.V.

Ménage à Trois

(Published on 5. December 2023, 05:16 by Die Hard)

Rules

Normal sudoku rules apply. Digits must not repeat on the marked diagonal. Digits in cages must sum to the cage total. Each N-sum line can be divided into two or more non-overlapping groups of adjacent digits that sum to N. No two lines have the same value for N.

Play on SudokuPad

Please leave a comment if you complete this puzzle.

Solution code: The 9 digits from row 1.

Last changed on on 6. December 2023, 12:05

Solved by Leonard Hal, pms_headache, Bjd, Dentones, tuturitu, Snookerfan, rameshsrivats, samuel1997, SparkNights, SenatorGronk, lmdemasi, TrollErgoSum, Paletron, Netra, AvonD, Jorrr2, cam, RickiFerrara, ... plica, P12345, SKORP17, madhupt, Dr Logic, houeland, MrQubo, Scorn, Leilalu222, karen_birgitta, Illuminated, OGRussHood, Askloomok, misko, Uhu, michaal94, ryanprobably, SudokuHero, PippoForte
Full list

Comments

on 23. December 2023, 18:16 by madhupt
A marvellous puzzle! So elegant and smooth. Thanks for sharing.

Last changed on 8. December 2023, 20:40

on 7. December 2023, 16:42 by GertVonnegut
This is a GREAT puzzle. Think I found the path early so it felt like the logic progressed straight through. Thanks so much for setting!

Die Hard: Thank you - I'm glad you enjoyed it.

Last changed on 8. December 2023, 20:42

on 6. December 2023, 18:28 by PierreTombal
Excellent setting. Not too hard and no notes required, unless you count a little Goodliffing as making notes. I'll bet Simon will love it as much as I did.

Die Hard: Thank you. It was both fun and a challenge to come up with the opening and to link it to the finale.

on 6. December 2023, 12:05 by Die Hard
Updated link to fix name.

on 6. December 2023, 08:20 by Norkas
Very nice flow to this puzzle.

Last changed on 6. December 2023, 05:29

on 6. December 2023, 04:25 by cam
Awesome puzzle! While I understand the comments and don't disagree, I was able to do this without taking notes and felt it followed a really nice logical progression that didn't require any extreme excursions. It was a very nice puzzle! It felt nice each time I figured out the next step :)

Die Hard: That's great! thanks.

on 6. December 2023, 00:54 by Jorrr2
Nice, very happy with my (sort of quick) solve. Cool puzzle!

Last changed on 5. December 2023, 20:11

on 5. December 2023, 18:59 by SenatorGronk
Really liked this, though I think it definitely helps to write down some notes to keep the possibilities straight.

Die Hard: I know there are definitely people (like Simon+Mark) who can do these sums in their heads with ease. However, I'm with you. And there were a LOT of notes used when creating this puzzle.

Last changed on 5. December 2023, 20:23

on 5. December 2023, 17:56 by samuel1997
Super cool puzzle!

Die Hard: Thank you - I am glad you enjoyed it.

Last changed on 5. December 2023, 20:08

on 5. December 2023, 17:15 by SparkNights
Hello~ I have a question. If an N-sum line could be divided into 4 segments of N=9, The line can be definitely regard as 2 segments of N=18. Then, which N should I choose? or, If the line existed, could I let another line to have an N of 9 or 18?

Die Hard: If the line existed, I would suggest it would NOT be OK to have another line with N=9 or N=18. However, at the risk of giving a potential clue, I think the simplest answer is that you won't face this dilemma in solving the puzzle logically.

Last changed on 5. December 2023, 20:24

on 5. December 2023, 11:24 by rameshsrivats
Super puzzle. Engaging all the way.

Die Hard: Thank you - I am glad you enjoyed it. It was certainly an interesting puzzle to set.

Last changed on 5. December 2023, 20:28

on 5. December 2023, 11:20 by Snookerfan
Lovely puzzle! After a tricky break-in it flowed really nice. Thank you

Die Hard: Thank you. Yes, this puzzle was definitely built from the break in and the challenge of designing an opening with this core ruleset and no givens. Then I worked on making it unique, solvable, and hopefully enjoyable.

Difficulty:4
Rating:95 %
Solved:58 times
Observed:7 times
ID:000G2I

Puzzle variant

Enter solution

Solution code:

Login