Logic Masters Deutschland e.V.

Chaos Deconstruction: Double Snake

(Eingestellt am 25. Juli 2022, 03:25 Uhr von KNT)

Place the numbers from 1 to 9 in the grid such that no number repeats in any row or column. Some numbers are already given. Each number belongs to an orthogonally connected region that contains each number from 1 to 9 exactly once. The regions must be located by the solver, and there are 9 total regions that must be located.

Two snakes, we call them snake A and snake B, are to be drawn in the grid. A snake is a one cell wide path that travels orthogonally from cell center to cell center. The snakes must not touch themselves anywhere - orthogonally or diagonally, but they may touch or even intersect each other. However, no two adjacent cells may belong to both snakes. The dashed circle indicates an end of a snake.

A number in a yellow cell indicates how many of the cells in the surrounding 3x3 area belong to snake A. A number in a blue cell indicates how many of the cells in the surrounding 3x3 area belong to snake B. A green cell behaves as both a yellow cell and a blue cell. All colored cells are nonempty.

Every region is entirely part of snake A, or entirely part of snake B. Cells where the snakes intersect belong to two regions simultaneously.

SudokuPad

penpa+

Lösungscode: Row 9 followed by Column 8, ignoring empty cells.

Zuletzt geändert am 15. Juni 2024, 22:56 Uhr

Gelöst von Vebby, RJBlarmo, Niverio, SirWoezel, PixelPlucker, JayForty, henrypijames, polar, the_cogito, Jesper, Koalagator2, marcmees, Siebuhh, ancarro, jkuo7, amarins, hepcecob, wenchang, harrison, PippoForte, cdwg2000, ma3n, Mody, Sewerin, Jaych, ONeill, Piatato, lerroyy, Feadoor, Saskia, Tom-dz, ibag, h5663454, Nick Smirnov, The Book Wyrm, dogfarts
Komplette Liste

Kommentare

am 22. April 2024, 18:12 Uhr von The Book Wyrm
Definitely the most cursed of the 3. Bit tricky in places, with some weird and interesting logic throughout. Fun puzzle.

am 26. August 2023, 20:59 Uhr von ibag
Smart construction, loved it!

am 23. Februar 2023, 15:43 Uhr von Piatato
Brilliantly constructed! Really good flow throughout!

am 12. Februar 2023, 14:10 Uhr von ONeill
Wow what a puzzle! Seems monstrous at first but begins to flow very nicely :)

am 28. Juli 2022, 18:52 Uhr von wenchang
Very hard!
https://youtu.be/SPm5HH-fMoA

am 28. Juli 2022, 05:44 Uhr von harrison
What a beautiful dark twisted fantasy that was!

am 25. Juli 2022, 22:23 Uhr von marcmees
an other masterpiece. thanks.

am 25. Juli 2022, 18:26 Uhr von Jesper
Thanks KNT, that was both really weird and cool. Always nice to wrap your head around something quite different!

am 25. Juli 2022, 18:00 Uhr von henrypijames
Don't be scared, people! This in only 4/5 difficulty - AKA a paper tiger. :D

am 25. Juli 2022, 17:21 Uhr von polar
Another brilliant construction! Thanks KNT :)

am 25. Juli 2022, 16:12 Uhr von JayForty
Amazing puzzle! Particularly enjoyed the multitude of different types of logic that had to/could be applied to solve it. Thanks!

am 25. Juli 2022, 14:06 Uhr von SirWoezel
Very tricky and at least as beautiful.

am 25. Juli 2022, 07:32 Uhr von Niverio
Very enjoyable and surprisingly smooth!

Zuletzt geändert am 25. Juli 2022, 05:01 Uhr

am 25. Juli 2022, 04:48 Uhr von RJBlarmo
Ruleset sounds pretty insane at first but the solve went quite smoothly for me. Lots of fun, thanks for setting!

----

Wow, that was a fast solve. Thanks for solving and I'm glad you enjoyed it! It certainly was a very difficult set for me, I've come back to this idea on and off for close to a month now, and I'm very glad I was finally able to make it work in a smooth way.

Zuletzt geändert am 25. Juli 2022, 05:01 Uhr

am 25. Juli 2022, 03:39 Uhr von Vebby
Mind-boggling, a real test! Very satisfying to solve. Amazing feat to construct this, oh evil setter, though I fear you suffered the worst DOS out of this entire escapade.

----

True, I definitely did DOS myself while setting this, haha

Schwierigkeit:5
Bewertung:97 %
Gelöst:36 mal
Beobachtet:8 mal
ID:000AKS

Lösung abgeben

Lösungscode:

Anmelden