Logic Masters Deutschland e.V.

The Carpenter's Watch

(Eingestellt am 15. November 2022, 01:31 Uhr von Perladel)

Rules:
Normal sudoku rules apply.
Whispers: neighbouring digits on a green line must have a difference of at least 5
Thermo: digits on a thermo must increase from the bulb

f-puzzles Link
CTC App Link

Lösungscode: Row 1 and Row 2 (no space)

Zuletzt geändert -

Gelöst von asver, Jagga, Raistlen, Domen19192, cbjenkins, dskaff, cdwg2000, nmmc123, Bjd, Ye Nay Myo Han, cegie, Myreque, Nicholas Roberts, Snookerfan, katy.lanka, Megalobrainiac, Ragna, SKORP17, Omnicole, ... AN_not_IO, Epsiloneuclid, dodomos, vmirandaa, Crul, Felis_Timon, PippoForte, flaemmchen, zrbakhtiar, Montikulum, dingledork, backermalaker, Carolin, PinkNickels, slowbiex, asii, damasosos92
Komplette Liste

Kommentare

am 25. April 2024, 14:06 Uhr von damasosos92
Lots of fun!

am 12. November 2023, 00:17 Uhr von PinkNickels
Super fun!

Zuletzt geändert am 16. November 2022, 19:33 Uhr

am 16. November 2022, 18:53 Uhr von JR_pianoman
Trickier than it initially appeared. Fun setting.

--Thank you for the feedback:)

Zuletzt geändert am 16. November 2022, 10:05 Uhr

am 16. November 2022, 09:31 Uhr von kross
I'm a beginner to sudoku (but I've been watching CTC), but I found the break-in pretty easily, so I'm sure more experienced solvers wouldn't have a problem spotting it.

Thanks for the fun puzzle!

--Thanks for your comment and I agree with you. I do think that the break-in is pretty obvious, but if you don't find it for some reason, this puzzle becomes a nightmare!

Zuletzt geändert am 15. November 2022, 16:04 Uhr

am 15. November 2022, 15:59 Uhr von halftime
Really fun back-and-forth between the two rules. Thanks for posting!

--Thanks a lot for the feedback. I don't know if everyone understood the break-in and solved the puzzle without bifurcating.
But I'm glad some people enjoyed it :)

Zuletzt geändert am 15. November 2022, 14:54 Uhr

am 15. November 2022, 14:49 Uhr von Ragna
Das hat Spaß gemacht!
Mille grazie :-))

-- Dankeschön, Ragna! :)

Zuletzt geändert am 15. November 2022, 14:55 Uhr

am 15. November 2022, 13:42 Uhr von Nicholas Roberts
Neat puzzle!

--Thank you very much!

Schwierigkeit:2
Bewertung:92 %
Gelöst:73 mal
Beobachtet:10 mal
ID:000C0G

Rätselvariante Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden