Logic Masters Deutschland e.V.

Anti-Knight Weirdity 4

(Published on 1. February 2022, 04:29 by Jeet Sampat)

Hungry Knights

This puzzle can be solved logically without any form of bifurcation. I hope you can find your way through this incredibly weird puzzle!

Rules:

Normal Sudoku rules apply.
Cells separated by a Chess knight's move must contain different digits.
Clues outside the grid give the sum of digits between 1 and 9 in the indicated row/column.
Adjacent digits on the green line must have a difference of at least 5.

Try it on the CTC app, or on f-puzzles.

Puzzle:

Solution code: Row 4 (left to right) and column 4 (top to bottom); 18 digits, no spaces.


Solved by cdwg2000, jalebc, Elliott810, zuzanina, Cane_Puzzles, marcmees, PippoForte, Krokant, SKORP17, Cowbear, Sumanta(ANU), ___, zlotnleo, wilsig, sandrokv, jwsinclair, avishai, Crul, jchan18, R3dD3vil2k6, ... Grooby84, ManuH, Uhu, Haba, Corey115, cha, avahales, Frans Wentholt, KatiBru, jadezki, apwelho, Miaocik, LadyShapeShifter, Koba, by81996672, forsen, jkl, DiMono, annnz, gxorgx, Blake Saligia, luuu
Full list

Comments

on 8. March 2022, 00:27 by Haba
Nice puzzle. I had a quick start, rather tough middle part but very satisfying ending.

on 2. February 2022, 05:13 by Jeet Sampat
Glad you did, @laregioncentrale :D

on 2. February 2022, 03:10 by laregioncentrale
Loved it!

on 1. February 2022, 17:04 by Jeet Sampat
It surely is a comedic duo! @Krokant ;)

on 1. February 2022, 14:25 by Krokant
Who'd have thought that hungry knights could be this entertaining. Fun puzzle. :)

on 1. February 2022, 10:55 by Jeet Sampat
Thank you for the kind words, @Elliott810!

on 1. February 2022, 10:11 by Elliott810
Beautiful puzzle! The relations between the constraints especially the 'hungry knights' are really magnificent. Thx for sharing:)

on 1. February 2022, 08:33 by Jeet Sampat
@cdwg2000 Thank you :)

on 1. February 2022, 06:36 by cdwg2000
Very nice!

Difficulty:3
Rating:91 %
Solved:69 times
Observed:19 times
ID:0008ZY

Variant combination Online solving tool

Enter solution

Solution code:

Login