Logic Masters Deutschland e.V.

Arcane Lavandula

(Eingestellt am 10. Mai 2025, 05:30 Uhr von NicoD)

Arcane Lavandula by Nicolas Duhail.

Rules
Place the digits 0 to 8 once each in every row, column and box.
Each line is either a zipper line or a thermometer.
Zipper: digits an equal distance from the center of a line must sum to the digit in the center of the line.
Thermometer: digits on thermometers increase from the bulb.

Play this puzzle on SudokuPad

Lösungscode: Row 3

Zuletzt geändert -

Gelöst von Silentdodo, TJ , Postnormal, Adrian71, alexsmart, Sinuit, micjo, AN_not_IO, Ramez, Elker, SKORP17, AnebodaSlatorp, arteful, efnenu, brimmy, dragoond, Md88keys, Jagga, 9x9, totem_mapr, bogdan2112, ... Gizmo, AvonD, abihummel, DeckersYay, abadx, ChessBattleAdvanced, benisjammin, ManuH, Koba, ecavalli, St9, teuthida, Archon, olliwright, Carbon, zrbakhtiar, Ton, Uhu, pepe74287, anotherpaulistring
Komplette Liste

Kommentare

Zuletzt geändert am 8. September 2025, 21:05 Uhr

am 8. September 2025, 18:02 Uhr von anotherpaulistring
One of very few "digits from 0-8" puzzles I've tried, so maybe it was the novelty of that, but this was really nice and refreshing to solve. (I'm going through your earlier puzzles; hoping to solve all the ones that I can manage!)
-----
ND: Thank you for solving! Have fun with the other ones.

Zuletzt geändert am 16. Mai 2025, 03:07 Uhr

am 15. Mai 2025, 23:23 Uhr von Archon
I had fun, thank you!
-----
ND: You are very welcome!

Zuletzt geändert am 10. Mai 2025, 21:05 Uhr

am 10. Mai 2025, 19:33 Uhr von AnebodaSlatorp
Very enjoyable
-----
ND: Thanks for solving!

Zuletzt geändert am 10. Mai 2025, 19:33 Uhr

am 10. Mai 2025, 18:15 Uhr von Ramez
Another beautiful puzzle from Nicolas. Thank you for setting and sharing.
-----
ND: Glad you enjoyed!

Zuletzt geändert am 10. Mai 2025, 13:30 Uhr

am 10. Mai 2025, 11:46 Uhr von Adrian71
Lovely puzzle, beautifully set, thanks for sharing!
-----
ND: You are welcome, thanks for solving!

Schwierigkeit:2
Bewertung:93 %
Gelöst:53 mal
Beobachtet:5 mal
ID:000N9M

Lösung abgeben

Lösungscode:

Anmelden