Logic Masters Deutschland e.V.

Killocator: Dead or Alive

(Eingestellt am 28. Februar 2024, 10:17 Uhr von starwarigami)


ctc link

Fill the grid with digits 0-9 so that no digit repeats in any row, column, or 3x3 box.
To enable this, there is a single Schrödinger cell in each row, column and box that contains two digits.

Digits may not repeat in a cage, and each cage sums to a 2 digit total. Cages of the same size must each have a different total.
If a cage enclosing n cells sums to a total "xy" then the digit n appears in row x column y. It is not necessarily the only digit in that cell.

e.g if a 4-cell cage sums to 25, then 4 must appear in R2C5.

Other challenging puzzles you may enjoy:

Lösungscode: Row 9 (left to right) - 10 digits, no spaces

Zuletzt geändert am 29. Februar 2024, 10:08 Uhr

Gelöst von ashisstuff, sanabas, A Mehdi, SenatorGronk, samuel1997, apothycus, lepton, amarins, rmn, Rafje, Aaronomys, peacherwu2, Hazem-77, Doofenschmirtz
Komplette Liste

Kommentare

am 5. März 2024, 04:47 Uhr von Aaronomys
This was so good, I broke it four times! Seriously though, the interactions explored in this puzzle are phenomenal.

am 29. Februar 2024, 18:12 Uhr von samuel1997
Brilliant! It caused me headache though and I have to rest now!

am 29. Februar 2024, 14:36 Uhr von A Mehdi
I thought i broked the puzzle but was able to solve it after rules update...
Very tough and beautiful puzzle !

am 29. Februar 2024, 10:02 Uhr von starwarigami
Updated rules for clarity.

Thanks to @sanabas for pointing out the misleading wording in the description!

Zuletzt geändert am 29. Februar 2024, 09:01 Uhr

am 29. Februar 2024, 08:51 Uhr von sanabas
That was incredible. Very tough to get started, and hard to keep track of possibilities. But after finally getting the first handful of digits, it still flowed really well, and remained reasonably challenging and extremely elegant until the end.

Highly recommend trying this.

Schwierigkeit:5
Bewertung:96 %
Gelöst:14 mal
Beobachtet:0 mal
ID:000H47

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden