Logic Masters Deutschland e.V.

Negative Sevens

(Eingestellt am 13. August 2021, 19:53 Uhr von jwsinclair)



Normal sudoku rules apply.
Cages show their sums. All possible two-cell cages that sum to 7 are given.
Along gray lines, which can have any length and can move orthogonally and diagonally, digits have a difference of exactly 7. All possible gray lines are given.
Along thermometers, digits increase from the bulb end.

f-puzzles
CtC

Lösungscode: row 1, row 9 (18 characters, no spaces)


Gelöst von kolot, baracartas, Jesper, barer, SKORP17, Lakritze, butch02, henrypijames, Cowbear, Innocuous, SudokuExplorer, DamnedLight, StefanSch, Julianl, zlotnleo, zorant, twobear, moss, bolado, PinkNickels, apwelho, taniabn, geronimo92, jodi264, StephenR, HighEagle, Leoninus, Sewerin, fca.felix.sudoku, mcc, RebelSystem, Krisonium, dendrobium, karen_birgitta, zrbakhtiar
Komplette Liste

Kommentare

am 9. Mai 2023, 15:07 Uhr von StephenR
Good job, thanks. Spotting the negative constraint is always fun and sometimes surprisingly elusive.

Zuletzt geändert am 30. Mai 2022, 04:55 Uhr

am 30. Mai 2022, 03:26 Uhr von PinkNickels
Amazing puzzle!
--

Thanks!

am 29. August 2021, 08:13 Uhr von Hausigel_mod
Labels/Tags changed

am 15. August 2021, 13:13 Uhr von henrypijames
Understood the logical consequences of the negative constraint fairly quickly, but had to restart a couple of times due to dumb mistakes.

am 14. August 2021, 21:34 Uhr von jwsinclair
@Innocuous,
Sorry, I'm not sure I understand your question, but the lines can have any length as long as they are connecting adjacent cells with a difference of 7 (i.e. 1818... or 2929...). The fact that the lines are short tells you that there are no such sequences longer than two cells in the puzzle.

Zuletzt geändert am 16. August 2021, 22:51 Uhr

am 14. August 2021, 21:15 Uhr von Innocuous
:edit: Nevermind! I had mis-read part of the rules

am 13. August 2021, 20:39 Uhr von kolot
Very nice!

Schwierigkeit:3
Bewertung:93 %
Gelöst:35 mal
Beobachtet:4 mal
ID:0007A2

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden