Logic Masters Deutschland e.V.

Happy Pi Day

(Eingestellt am 15. März 2023, 19:50 Uhr von Andrewsarchus)



less thematic version recommended for solving:


Rules:
  • Normal Latin Square rules apply.
  • Antiknight: digits a knights move apart must not be the same.
  • Nonconsecutive: orthogonally adjacent digits must not be consecutive.
  • German Whispers: digits next to each other on a line must differ by at least 5.
  • XV Pairs: digits on an X must sum to 10 (no negative constraint)


Notes:
  • Difficulty: one of my testers recommended that I warn potential solvers about the difficulty. Two hard to spot (but fair) deductions are required for the break-in, and it may not be immediately obvious that these two deductions are related.

  • Theme: The main image is thematic, using circles to represent pies, hiding the gridlines, and referring to cells as "pies" in the rules.
    A link to the thematic version is here: happy pi day
    However, I recommend you instead use one of the links below, which abandons the thematic cosmetics.
    (the cosmetics interfere the ability to show highlighting and current cell selection)


Play Online:

     f-puzzles: Happy Pi Day

     ctc: Happy Pi Day

Lösungscode: Row 8 and Column 8
(left to right, top to bottom, no spaces)


Gelöst von StefanSch, Vebby, Dentones, SKORP17, jalebc, Leonard Hal, butch02, bansalsaab, henrypijames, boriss, Chriso, lerroyy, grkles, Bankey, PippoForte
Komplette Liste

Kommentare

am 27. April 2023, 13:30 Uhr von Bankey
That was a tough one, with a very narrow solve path; but satisfying to have got thru in the end. Thanks for sharing, @ Andrewsarchus :)

am 20. März 2023, 19:03 Uhr von Chriso
My first attempt to solve a hard puzzle. Took me around 6 hours. First digit after 3min, second after 2 hours. Also a mistake somewhere in the middle that I didnt notice, made me start over. But even after that the puzzle was fun till the end. Thank you

Schwierigkeit:5
Bewertung:86 %
Gelöst:15 mal
Beobachtet:3 mal
ID:000DAF

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden