Logic Masters Deutschland e.V.

An Unusual Miracle

(Eingestellt am 20. Dezember 2024, 04:32 Uhr von blackjackfitz)

An Unusual Miracle

Play on Sudokupad


Rules:
  • Fill every empty (white) cell with a digit from 1-9 such that a digit doesn't repeat in any row or column.
  • If a digit 'n' appears in the puzzle, it appears exactly 'n' times.
  • Cells a knights move away (in chess) cannot contain the same digit.
  • Cells a kings move away (in chess) cannot contain the same digit.
  • For clarity, black cells remain empty but contribute towards knights move spacing.

I hope you enjoy it!

Lösungscode: Column 4 digits (7 numbers)


Gelöst von arteful, fuxia, tiuhto, Archon, fkib, Bulkystapler, lmdemasi, Silverscree, ademjaz, logik66, EFlatMinor, rkm_sts, Vulajin, bukszpryt, Snookerfan, Franjo, Gullie, samuella, bittersteel, Chlorophyll, ... Sotehr, Nell Gwyn, juggler, karlmortenlunna, iash, vmirandaa, Kallor, Ye Nay Myo Han, samjna0049, siliciousreese, Tinica, Crusader175, paranoid, Hammond X, BabyfacedBard, yttrio, mitchalltogether
Komplette Liste

Kommentare

am 30. Dezember 2024, 18:18 Uhr von Crusader175
Cool idea!

am 24. Dezember 2024, 03:47 Uhr von juggler
Wow, I have no idea how you set this.

am 22. Dezember 2024, 12:46 Uhr von GameWorksRP
This an amazing concept very well used. Thank you!

am 21. Dezember 2024, 20:49 Uhr von piotr357
Wow! Wow! Wow! Wow! Wow! Wow! Wow! Wow!

am 21. Dezember 2024, 05:38 Uhr von Fisherman
Oliver asks for more.

am 20. Dezember 2024, 23:53 Uhr von polcat
Brilliant!

am 20. Dezember 2024, 16:17 Uhr von Visumation
Really cool discovery. Enjoyed it a lot.

am 20. Dezember 2024, 08:07 Uhr von logik66
Fantastic puzzle

am 20. Dezember 2024, 07:59 Uhr von Silverscree
I enjoyed this a lot! This forced me to use a different sort of colouring to that which I am used to.

am 20. Dezember 2024, 07:39 Uhr von Bulkystapler
I found myself wondering if I can take it for granted that digits do not repeat in rows or columns in the blacked out area of the grid. I enjoyed the confusion though!

Schwierigkeit:2
Bewertung:97 %
Gelöst:97 mal
Beobachtet:4 mal
ID:000L71

Lösung abgeben

Lösungscode:

Anmelden