Logic Masters Deutschland e.V.

10-in-9 killer sudoku #3

(Eingestellt am 11. Februar 2020, 22:35 Uhr von Nylimb)

This is a variant of a killer sudoku, in which some cells contain 2-digit numbers.

Fill the grid with 1-digit and 2-digit numbers, so that every row, column, and 3x3 box contains each of the 10 digits, from 0 to 9, exactly once: Eight cells contain 1-digit numbers, and the other cell contains a 2-digit number (from 10 to 98).

In each cage indicated by the dotted lines, the number at the top left is the sum of the numbers in the cage. Also, no digit can occur more than once in a cage, whether it's alone in a cell or part of a 2-digit number.

In my previous puzzles of this type, there were some cages whose sums were so large that they must contain a 2-digit number, or so small that they could only contain 1-digit numbers. This puzzle has no such cages; no single cage gives any information about where the 2-digit numbers are located. Nevertheless, there is a logical path to the solution.

I think this puzzle is harder to solve than either 10-in-9 killer sudoku #1 or 10-in-9 killer sudoku #2. It was certainly harder to create.

Lösungscode: Row 2 and column 2. Include both digits of the 2-digit numbers.


Gelöst von cdwg2000, sf2l, Ragna, Julianl, Realshaggy, Nothere, Sango, marcmees, jessica6, ManuH, Mody, ch1983, zuzanina, moss, Statistica, HaSe, pokerke, ropeko, tuace
Komplette Liste

Kommentare

am 13. Februar 2020, 16:49 Uhr von Nylimb
@jessica6: In your second paragraph you listed 10 and 19 as possibilities, and your 0+2 reasoning makes 10 impossible. But 19 is possible.

am 12. Februar 2020, 22:15 Uhr von Realshaggy
Amazing!

Zuletzt geändert am 12. Februar 2020, 09:33 Uhr

am 12. Februar 2020, 09:32 Uhr von cdwg2000
Thanks.So crazy puzzle! The design is very clever!It has a unique set of solutions, and at the same time, the logical path to solve the problem is unique!

Schwierigkeit:5
Bewertung:99 %
Gelöst:19 mal
Beobachtet:0 mal
ID:00037M

Arithmetikrätsel Variante eines Standardrätsels

Lösung abgeben

Lösungscode:

Anmelden