Logic Masters Deutschland e.V.

The Imposter

(Eingestellt Heute, 02:41 Uhr von KMD)

Hello, Kennet's Dad here. This puzzle is an "easier" sequel/primer to a much harder puzzle I recently published with the same rule set. "Imposter Syndrome"

That said, I believe this puzzle is equally as beautiful and challenging nonetheless. So please let me know how you get on.

Rules:

  • Normal sudoku rules apply.
  • Each 2x2 area of cells in the grid must include at least one digit from each of the following sets: (147), (258), (369).
  • Digits along an arrow sum to the digit in that arrow’s circle.

Solve using Sven's Sudokupad

Lösungscode: Column 9, top to bottom


Gelöst von onlainari, EFlatMinor, SeveNateNine, Elliott810, Snookerfan, tuturitu, Piff, Qodec, efnenu, lianarox, Vionix, SKORP17, Franjo, olegavibe, jsxft, ZornsLemon
Komplette Liste

Kommentare

Heute, 19:34 Uhr von Franjo
Thank you very much for creating and sharing this wonderful puzzle. Almost incredible how this unusual global constraint works!

Zuletzt geändert Heute, 14:12 Uhr

Heute, 12:27 Uhr von Qodec
It must have been tough to create a puzzle with such an unintuitive global constraint, base a solution path on it, and still invoke a sense of beauty and splendor. That was impressive.

Thank you Qodec! You’ve always been a great supporter. This puzzle came together quick, but I sat with the ideas about 6 months for the first puzzle.

Zuletzt geändert Heute, 13:25 Uhr

Heute, 10:12 Uhr von Snookerfan
Great puzzle! Top notch setting, because as said in my comment on your previous installment, I find global modularity usually way harder than global entropy and still these puzzles are really smooth, especially this one. Thanks

You’re very kind Snookerfan. I’m glad you enjoyed this one too.

Zuletzt geändert Heute, 13:25 Uhr

Heute, 09:52 Uhr von Elliott810
Brilliant puzzle! I've failed to finish the first 'Imposter', but remembered the beautiful break-in. So the start was easy, but the remainder feels pretty hard to me. Thank you:)

Thank you Elliot; coming from one of the best solvers, I appreciate that.

Schwierigkeit:3
Bewertung:89 %
Gelöst:16 mal
Beobachtet:0 mal
ID:000S8W

Lösung abgeben

Lösungscode:

Anmelden