Logic Masters Deutschland e.V.

Kissing Zipper

(Eingestellt am 18. Februar 2025, 08:00 Uhr von twototenth)

Normal Sudoku rules apply. Purple lines are zipper lines; digits an equal distance from the center must sum to the digit in the middle of the line.

The grid contains nine "doublers," one in each row, column, and box; each digit from 1-9 is "doubled" exactly once. Doubled digits count as twice their value for the purposes of the zipper lines.

F-puzzles link

Sudokupad link (with solution check)

Lösungscode: Row 9, left to right

Zuletzt geändert -

Gelöst von StevenS, efnenu, Piff, rameshsrivats, BenTen, Joyofrandomness, Chelo, thoughtbyte, Mr_tn, Bjd, tallcat, SKORP17, sedici, PaganiusI, KlausRG, lune, arctan, JohnDoeJersey, cmigas, Julianl, BTLRob, ... Hedlights, P12345, Druselbert, MikeMeech, fthompson, karlmortenlunna, JackofJack, tome_coelho, Ragna, Vaurien, tapocol, madhupt, mew_rocks, thargian, Doc-Pierre, Khatru, seaweed, OGRussHood
Komplette Liste

Kommentare

am 28. Februar 2025, 01:30 Uhr von Ragna
Very nice puzzle! And I loved it to see Simon and Chain Bear solving together. That was fun. Thank you for this puzzle. :-)

am 22. Februar 2025, 15:50 Uhr von damo_89
Looked impenetrable, wound up being almost approachable. Lovely stuff. That given digit is mighty!

am 18. Februar 2025, 18:30 Uhr von PaganiusI
Really smooth and interesting from start to finish, thanks alot!

am 18. Februar 2025, 17:38 Uhr von tallcat
Delightful puzzle - and a welcome return from a great setter :)

Zuletzt geändert am 18. Februar 2025, 17:12 Uhr

am 18. Februar 2025, 17:11 Uhr von thoughtbyte
One of my favorite puzzles of recent memory. Super smooth throughout with beautiful, elegant logic and a very consistent approachable difficulty. Thanks!

am 18. Februar 2025, 14:01 Uhr von BenTen
Very nice puzzle. I enjoyed the opening logic especially. Thanks for setting.

am 18. Februar 2025, 13:55 Uhr von rameshsrivats
Beautiful puzzle

Schwierigkeit:3
Bewertung:94 %
Gelöst:51 mal
Beobachtet:1 mal
ID:000M1W

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden