Logic Masters Deutschland e.V.

Haddie's 11th

(Eingestellt am 10. März 2023, 00:51 Uhr von Tanadien_Whiteowl)

This is in honor of what would have been my daughter's 11th birthday. 4th July, 2012

This journey started over a year ago when I sat down to play with designing a puzzle to get my mind off the holidays and the fact that this was the 10th Christmas missed. When her birthday came around in July, I wanted to thank Mark and Simon for all they did to keep us sane during the challenging times of the early 2020s, and I sent them the puzzle I created during the holiday season. Seeing Mark solve it made me think that I could do this, and I sat down and started thinking about ways to create puzzles. Some were silly, some challenging, and others were left on the cutting room floor. This is the 3rd in a line of puzzles I have created in a memorandum of hers, and this series may never see another puzzle, or I may never stop. Time will tell. Thanks to each of you for solving and critiquing each puzzle I have put on here. Enjoy this one, and happy solving. - Tanadien Whiteowl

Rules:

  1. Normal Sudoku rules apply
  2. Digits cannot repeat in a cage and must total to the number in the top left corner of the cage
  3. Cells must sum to the number given by the indicated diagonal
  4. Digits along a thermometer must increase from the bulb end.
  5. Cells within a Knights Move of one another cannot be the same digit

    Puzzle:

    Links:

    F-Puzzles

    CTC

Lösungscode: Column 1 and Row 1 (18 Digits, Column 1 first)

Zuletzt geändert am 10. März 2023, 17:48 Uhr

Gelöst von jalebc, StefanSch, SKORP17, Bjd, mobiustrip, PippoForte
Komplette Liste

Kommentare

am 10. März 2023, 17:07 Uhr von Tanadien_Whiteowl
Added Anti Knight rule that i omitted originally

am 10. März 2023, 12:58 Uhr von Tanadien_Whiteowl
Thanks @ StefanSch, I will make this fix.

am 10. März 2023, 11:50 Uhr von StefanSch
Thank you for this puzzle!

In the f-puzzle-link the "Antiknight"-option is activated. But this rule isn't mentioned here?!

Schwierigkeit:3
Bewertung:N/A
Gelöst:6 mal
Beobachtet:2 mal
ID:000D81

Lösung abgeben

Lösungscode:

Anmelden