Logic Masters Deutschland e.V.

Limiting Factors (Non-Consecutive)

(Eingestellt am 23. November 2023, 05:03 Uhr von Scruffamudda)

Normal sudoku rules apply.

Orthogonally adjacent digits must not be consecutive.

A digit in a circle or square must not be a multiple or divisor of any orthogonally adjacent digit.

Circles contain odd digits. Squares contain even digits.

SudokuPad link

f-puzzles link

Lösungscode: row 9


Gelöst von rahu, lmdemasi, Isael, zuzanina, Chelo, pms_headache, federeboh, Ragna, anyeyeball, kporadzinski, SKORP17, efnenu, Sanger54, by81996672, pazqo, wilsig, Qodec, frankpujo, ryanprobably, sedici, ... bloogercloge, Illuminated, filmore, WvdWest, michaal94, loveshousi, yangduoxing, Uhu, Lorenz, lovely, trashghost, redfoot, Abbott Abbott, chanelaw, Ploctypus, SudokuHero, cybers, PippoForte, bolado
Komplette Liste

Kommentare

am 26. November 2023, 17:49 Uhr von Puzzle Weasel
An incredible construction, thank you.

am 26. November 2023, 17:28 Uhr von Klausku
Amazing puzzle. Could not believe that it solves uniquely and smoothly. Thanks

am 25. November 2023, 01:42 Uhr von jhernandezc
Spectacular.

am 24. November 2023, 13:51 Uhr von Qodec
Very interesting, thank you!

am 24. November 2023, 13:44 Uhr von wilsig
Very nice puzzle. 2* difficulty.

am 23. November 2023, 14:37 Uhr von kporadzinski
One of the best puzzles of my life. In fact, when I started solving it, I was convinced that there was too little information to do it. It was amazing how step by step each problem disappeared. What's even more amazing is how you can come up with such a riddle. Huge congratulations for such a great idea. Wow!

Zuletzt geändert am 23. November 2023, 14:30 Uhr

am 23. November 2023, 14:29 Uhr von anyeyeball
This took me a good long while to break into, but was very enjoyable. It's amazing how strong that consecutive constraint is. Thank you for a very nice puzzle.

am 23. November 2023, 14:14 Uhr von Ragna
Das hat Spaß gemacht. Dankeschön! :-)

Schwierigkeit:3
Bewertung:92 %
Gelöst:94 mal
Beobachtet:9 mal
ID:000FXI

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden