Logic Masters Deutschland e.V.

The miracle in cell nº7

(Eingestellt Gestern, 17:36 Uhr von Duarte-Carvalho)

Normal sudoku rules apply. The grid is mostly covered by fog, entering a correct digit will clear the fog around the correct placed digit. Killer cages: digits in a killer cage must sum to the number in the top left corner and cannot repeat. Any two cells separated by a knight's move or a king's move (in chess) cannot contain the same digit. The numbers of two orthogonally adjacent cells may not be consecutive. Even: grey squares must contain an even digit.

Solve online here: SudokuPad Puzzle

If you like this puzzle you may enjoy some of my other puzzles too, click HERE to see the other puzzles I have made.

Lösungscode: Row 7


Gelöst von jalebc, SKORP17, Zibl, BULL-TT, keenbowl, 3ColorTheorem, Sarhik, FireTruckFuel, Rearden, jadezki, johnreid, Alce, Harold, rubbeng, milxqueen, Ryaffio, Killer-Ly , mabjim007, Sollun, Iluvsodah, xrrx, ... fuxia, connnor, geronimo92, DerRiese, Hyoryn, sarabtx, wjdrumm, jkuo7, drf93, Dacmon, apendleton, jguer, BenClancy, luoji, Fisherman, kublai, Elizy, jinkela114514, Snuggles, josemadre, TeddieMilo
Komplette Liste

Kommentare

Heute, 07:24 Uhr von TeddieMilo
Very nice. The combination of anti king/knight and non consecutive rules makes it approachable. TQ!

Heute, 05:55 Uhr von jinkela114514
How to prove that the anti-knight and the anti-king combined forces a certain pattern?

Heute, 03:36 Uhr von Dacmon
Geez laweez that was not level 1. Arguably level 2 since, after you find the trick, the puzzle falls upon itself.

Heute, 02:33 Uhr von VitP
definitely not level 1.
yes, you can make some easy progress early on, but you quickly run into a position where you need either massive bifurcation, or knowledge of some pattern that only a setter would know.

Heute, 01:10 Uhr von DerRiese
Wonderful!

Gestern, 18:14 Uhr von Zibl
Really nice puzzle as always!

Schwierigkeit:1
Bewertung:90 %
Gelöst:51 mal
Beobachtet:0 mal
ID:000PO1

Rätselvariante Variantenkombination

Lösung abgeben

Lösungscode:

Anmelden