Logic Masters Deutschland e.V.

Quknighted

(Eingestellt am 14. August 2021, 20:14 Uhr von ebbelwoi)

  • Each row and every column contain the digits 1-8.
  • Antiknight: Cells wich are a chess-knight's move apart must not contain the same digit.
  • Little Killer Diagonals:
    Digits along an indicated diagonal add to the sum given.
  • Little Killer Regions:
    Digits inside a coloured region add to the sum given in the top-left corner.

Although I couldn't create an irregulat 8x8-grid on f-puzzles, I provide the link here to enable you to play around with the puzzle a bit. f-puzzles

Lösungscode: row 3 + column 5

Zuletzt geändert am 7. September 2021, 20:50 Uhr

Gelöst von Realshaggy, SirWoezel, marcmees, Raistlen, zhergan, SKORP17, Playmaker6174, bob, CJK, Voyager, Mark Sweep, CHalb, rimodech, misko, zorant, Uhu, ManuH, moss, DiMono
Komplette Liste

Kommentare

am 7. Mai 2022, 03:06 Uhr von DiMono
I made a Penpa+ link with answer check https://tinyurl.com/2p95fy5b

I think it's a decent puzzle. I enjoyed it.

am 7. September 2021, 20:50 Uhr von ebbelwoi
changed labels back - THERE IS NO KILLER_CAGE, @hausigel_mod !

even if you seem to be proud of the new labels.

am 16. August 2021, 16:12 Uhr von ebbelwoi
here's a better f-puzzles link based on Realshaggy's hint. Thanks again.
https://f-puzzles.com/?id=yzn35k5o

am 16. August 2021, 16:01 Uhr von ebbelwoi
@Realshaggy, @SirWoezel
You are right, there are no (killer)-cages here, but little-killer-regions.
Thanks for the f-puuzzles hints.

Zuletzt geändert am 14. August 2021, 21:53 Uhr

am 14. August 2021, 21:20 Uhr von Realshaggy
You can set the regions to be like columns (so that they apply no additional constraint). Like in that link:
https://f-puzzles.com/?id=ye5l6tad
That still doesn't solve the problem that normal Killer cages are assumed to have no repeated digits, so you should use cosmetics if you define such cages.

Schwierigkeit:3
Bewertung:63 %
Gelöst:19 mal
Beobachtet:3 mal
ID:0007AF

Variantenkombination Online-Solving-Tool Lateinisches Quadrat

Lösung abgeben

Lösungscode:

Anmelden