Logic Masters Deutschland e.V.

Testing 1, 2, 1, 2, is there a miracle here

(Eingestellt am 2. Februar 2024, 12:00 Uhr von kierownik)

  1. Normal 9x9 sudoku rules apply: In every row, column and in every 3x3 box the digits from 1 to 9 have to appear atleast once with no repeats.
  2. Anti-king: Cells seperated by a king’s move in chess cannot have the same digit.
  3. Anti-knight: Cells seperated by a knight’s move in chess cannot have the same digit.
  4. Non-consecutive: Cells that are orthogonally adjacent cannot contain consecutive digits.
Sirxemic’s Sudokumaker   Sven's Sudokupad

Have fun in playing the puzzle and leave a kind message :-]
Streamers may use all my puzzles.

Lösungscode: Row 3 and 7. Left to right.

Zuletzt geändert -

Gelöst von galium_odoratum, jalebc, Steven R, Puzzle Weasel, PinkNickels, Ragna, kublai, Greg, pepe74287, Kupais, teuthida, saskia-daniela, Guillem98, SKORP17, cathematician, stonetim, Chelo, keenbowl, Eraelan, ... ellamackmitch, Mup, pillowss, rares495, pethejasraj, jgarber, Awoobledoople, Koba, drifting, neinina98, PippoForte, Kabuki73, Blake Saligia, augsod, Meghan29, k2u5as, Villse, eriktenasbroek
Komplette Liste

Kommentare

am 7. April 2024, 20:03 Uhr von chain.reader
very nice!

am 10. Februar 2024, 05:22 Uhr von Tingo
I love me a miracle sudoku. This is no different. Thanks for setting and sharing!

am 3. Februar 2024, 23:45 Uhr von VitP
it's a MIRACLE how easily this solves ... if you know the procedure

am 3. Februar 2024, 20:21 Uhr von larmoejr
That was fun :)

am 3. Februar 2024, 02:56 Uhr von jadezki
A perfect breakfast puzzle! :D Thank You!

am 2. Februar 2024, 21:54 Uhr von kross
Very reminiscent of the Mitchell Lee miracle. I even used the same technique as featured on the CTC video to solve it. Thanks, it was fun! :)

am 2. Februar 2024, 20:23 Uhr von Ryx
To those familiar with Mitchell Lee's miracle, this is an easy question ;-) Nice puzzle!

Schwierigkeit:2
Bewertung:88 %
Gelöst:171 mal
Beobachtet:6 mal
ID:000GFT

Variantenkombination Online-Solving-Tool Schach

Lösung abgeben

Lösungscode:

Anmelden