Logic Masters Deutschland e.V.

Chasm Construction

(Eingestellt am 23. Mai 2024, 22:35 Uhr von AFrayedKnot)


Rules

Fill 81 cells with a digit from 1-9 so they form 9 different orthogonally connected 9-cell regions.
Regions may not touch orthogonally.
Digits may not repeat within rows, columns, nor regions.

The number of distinct digits along an arrow's line of sight must equal the number in the arrow's cell.
All arrow cells must contain digits.

Penpa Link
SudokuPad Link


Lösungscode: row 9's digits, then row's 12 digits


Gelöst von SPREVVIE, KNT, Tom-dz, henrypijames, gynu, nuzzopa, cornish-john, Snookerfan, h5663454, MicroStudy, jkuo7, Jesper, marcmees, bansalsaab, teff, Paletron, Felis_Timon, Piatato, GentlemanJim, ... OGRussHood, arauwer, halakani, mang0, SeveNateNine, Christounet, dennischen, Aeterrno Amora, ns08, codewizard, madhupt, escutcheon, starelev5, Niverio, davidxxy, mattlafy, zakkai, Bankey, jmw
Komplette Liste

Kommentare

am 9. Oktober 2024, 18:52 Uhr von Bankey
Wow, that one fought till the very end. But a fun-filled ride it was. Thanks, @ AFrayedKnot :).

am 20. Juni 2024, 10:41 Uhr von Christounet
Awesome !! Thanks :)

am 2. Juni 2024, 00:55 Uhr von wenchang
NICE and HARD! Spoiler alert! https://youtu.be/LD99n3ozQKU

am 31. Mai 2024, 22:37 Uhr von PlumpestPlumber
This is one of the best puzzles I have solved! It took a while but did not feel like a 5 star difficulty puzzle. Thank you very much for the puzzle.

am 30. Mai 2024, 00:15 Uhr von Agent
Very nice puzzle and inventive ruleset! These diagonal arrows were sneaky.

am 29. Mai 2024, 06:33 Uhr von cristophermoore
This was EPIC. I love how the clues play multiple roles, near and far, and both early and late in the game. Great logic on both the shapes and the numbers. I really want to know how you set it :-)

am 29. Mai 2024, 02:00 Uhr von heliopolix
Fantastic construction. Very clean grid coupled with impeccable logic!

am 29. Mai 2024, 01:57 Uhr von scottgarner
Beautiful puzzle!

am 29. Mai 2024, 01:39 Uhr von karlmortenlunna
That was a fantastic puzzle! One of my all time favourites. Thanks.

am 28. Mai 2024, 21:26 Uhr von omran
The ending was cruel!
spotting that arrow after spending 2 hours at the bottom took me very long XD.

very cool puzzle overall!

am 27. Mai 2024, 13:03 Uhr von Smoncko
That was fantastic! Loved the puzzle!

am 26. Mai 2024, 02:00 Uhr von kamkam
Wow we really get lost in that puzzle. To get around the rules is not tricky, but to find where the next step is is a lot. Cool puzzle

am 25. Mai 2024, 13:46 Uhr von The Book Wyrm
Fun puzzle!
Very interesting and unique ruleset, with some cool interactions, especially in the region building.

am 25. Mai 2024, 07:41 Uhr von zzw
Wonderful puzzle all the way through!

am 25. Mai 2024, 04:03 Uhr von Calvinball
Amazing from start to finish, I loved how clues just bobbed and weaved into relevance.

am 25. Mai 2024, 01:41 Uhr von SudokuHero
Such a nice construction.

am 24. Mai 2024, 23:39 Uhr von Jolly Rogers
Incredible setting, incredible puzzle, incredible idea and all beautifully executed!

am 24. Mai 2024, 22:20 Uhr von jwsinclair
Such a great puzzle, and one of the toughest I've ever solved. I don't always have the attention span for the really tough ones, so it speaks to how well-constructed this is that I was so engaged for the entire [amount of time redacted]

am 24. Mai 2024, 20:42 Uhr von Piatato
Awesome!

am 24. Mai 2024, 17:08 Uhr von bansalsaab
That was amazing

am 24. Mai 2024, 17:03 Uhr von marcmees
exceptionally beautiful. Thanks

am 24. Mai 2024, 16:49 Uhr von Jesper
Great puzzle, thanks!

am 24. Mai 2024, 15:05 Uhr von MicroStudy
i love counting!!!

am 24. Mai 2024, 13:06 Uhr von Snookerfan
Great puzzle! I enjoyed it immensely. Thank you

am 24. Mai 2024, 07:14 Uhr von henrypijames
And next, KNT will set a disconnected version of this [exploding head emoji].

am 24. Mai 2024, 05:42 Uhr von KNT
really really fun, thanks!!

Schwierigkeit:5
Bewertung:98 %
Gelöst:103 mal
Beobachtet:6 mal
ID:000I79

Rätselvariante Färberätsel Zerlegungsrätsel Polyominos

Lösung abgeben

Lösungscode:

Anmelden