Logic Masters Deutschland e.V.

The Bee - (Region Sum/Renban Lines)

(Eingestellt am 29. August 2022, 14:15 Uhr von Ennead)

(Flying Insects Series - 1/3)

Normal sudoku rules apply.

Purple lines must contain a set of non-repeating consecutive digits in any order.

Additionally, every line has a region sum total N. In each of the 9-cell regions that a line passes through, the digits on that line in that region sum to N. N is not the same for every line.




f-puzzles CTC


Lösungscode: Column 2 followed by row 8. (18 digits, no spaces)

Zuletzt geändert am 29. August 2022, 17:55 Uhr

Gelöst von Fago, SKORP17, Jesper, MONICHOO, pepu273, Bjd, Dermerlin, Xendari, jalebc, AnalyticalNinja , AvonD, Jdt112, butch02, Hecspeed, galgamer, brimmy, cdwg2000, lsw770770, Statistica, Dentones, tuckerbucket, PippoForte, yttrio, mse326, karen_birgitta, by81996672, Krisonium
Komplette Liste

Kommentare

Zuletzt geändert am 31. August 2022, 13:56 Uhr

am 31. August 2022, 13:38 Uhr von Hecspeed
A puzzle of rewarding deductions with a smooth flow. Thanks!
- You are most welcome! Glad you enjoyed it.

Zuletzt geändert am 30. August 2022, 09:01 Uhr

am 30. August 2022, 08:45 Uhr von Xendari
Fantastic! I really enjoyed this puzzle. The logic was quite beautiful in some places - every time I got stuck, I knew I was about to be rewarded for advancing. Personally I thought the difficulty was 4/5 instead of 3, but I did neglect to consider one breakthrough area for too long. Thank you for setting and sharing!

- Thanks! I'm happy you enjoyed it. This puzzle was great fun to set and it accidentally looked like a bee! I took that as inspiration and set 2 more puzzles themed around flying insects with the same constraint. Coming soon!

am 29. August 2022, 17:56 Uhr von Ennead
The links have now been changed. Sorry about that!

am 29. August 2022, 14:22 Uhr von Ennead
Oops. Sorry about that. I'll fix it later.

am 29. August 2022, 14:20 Uhr von Ragna
Klick on CTC, there is another puzzle.

Schwierigkeit:3
Bewertung:94 %
Gelöst:27 mal
Beobachtet:4 mal
ID:000B0N

Variantenkombination

Lösung abgeben

Lösungscode:

Anmelden