Logic Masters Deutschland e.V.

The Serpent Devouring Rome

(Eingestellt am 18. März 2024, 01:16 Uhr von JeffWajes)

The Serpent Devouring Rome
By Jeff Wajes

Normal Sudoku rules apply.

In a cage, digits do not repeat and sum to the given total. Digits connected by an X or V sum to 10 or 5, respectively.

Draw a one-cell wide snake that moves orthogonally through the grid without touching itself, even diagonally.

The snake cannot enter any cages, but it must include every cell that touches an X or V, including every X and V not given.

Play on CTC

Lösungscode: Row 1

Zuletzt geändert am 18. März 2024, 01:21 Uhr

Gelöst von palpot, SKORP17, Snookerfan, CrippledLamp, hoopsie, Brodie2000, SudokuHero, StefanSch, bansalsaab, emoney13, cristophermoore, Starlight, JustinTucker, keerdelta, mew_rocks, jkuo7, dtoto, 5Head
Komplette Liste

Kommentare

am 21. März 2024, 07:17 Uhr von cristophermoore
quite subtle logic! I really enjoyed it. Also a great title :-)

am 20. März 2024, 18:52 Uhr von emoney13
Really good puzzle! Flowed really nicely and I love the rules

am 19. März 2024, 19:25 Uhr von JeffWajes
@bansalsaab No pair of digits in or touching a cage may add to 10 or 5. Looks like you solved it anyway, though!

@snookerfan Thanks so much!

Zuletzt geändert am 19. März 2024, 18:23 Uhr

am 19. März 2024, 17:18 Uhr von bansalsaab
Hi Jeff, does the negative constraint apply to the orthogonal pairs where one cell is in cage and other is not? For example is the caged cell is 3, does it rule out the 2 and 7 from non caged orthogonal neighbors?
Or another case, can 2 digits in a cage add up to 5/10 since they are not supposed to be on snake

am 18. März 2024, 16:44 Uhr von Snookerfan
Magnificent puzzle! Those rules worked perfectly together and gave some gorgeous deductions. Thank you

am 18. März 2024, 04:29 Uhr von JeffWajes
@rameshsrivats Yes, that's correct.

am 18. März 2024, 04:10 Uhr von rameshsrivats
Just to clarify, do you mean that if two adjacent cells add up to 5 or 10, the snake must go through them even if there is no marking?

Schwierigkeit:5
Bewertung:91 %
Gelöst:18 mal
Beobachtet:1 mal
ID:000HCP

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden