Logic Masters Deutschland e.V.

The Power Of The Killer Knights

(Eingestellt am 20. Januar 2023, 22:17 Uhr von Tingo)

The Power Of The Killer Knights

This is the fifth in my "Power of the Knights" series.

The entire series can be found here

Normal Sudoku Rules Apply

Cells separated by a knight's move (in chess) cannot contain the same digit.

Cells separated by white dots are consecutive in value. Not all white dots are given.

Cells separated by Xs sum to 10. Not all Xs are given.

Each cage represents a "knight". Each "knight" has a rank of 2,3,4,5 or 6. The rank of the knight is designated by the number of cells within the cage. The cage total is equal to the rank of the knight squared. E.G. digits in a 4 cell cage must sum to 4^2 or 16. Digits cannot repeat within cages.

The puzzle can be played at F-Puzzles here!

The puzzle can be played at CTC here!

Questions, comments, concerns and jokes are all welcome! Thanks for playing!

Lösungscode: Row 9 followed by Column 4, no spaces


Gelöst von SKORP17, OutOfMyMindBRB, nmmc123, Entropywins, mutex, Jagga, AvonD, ofsmul, dskaff, Buttafingazz, jalebc, by81996672, Enkerro, pepe74287, ViKingPrime, TNGuy, asver, Debba, farodin64, ... juddimal, Saskia, Zer0rc21, Bconner5, lovely, Montikulum, HumanBirdsong, Felis_Timon, PippoForte, DanSkorne, MB_Cyclist, MeltCatAmy, rav, elpizw, jadezki, MaxSmartable, Kekes, Koba, fca.felix.sudoku
Komplette Liste

Kommentare

Zuletzt geändert am 22. Januar 2023, 05:35 Uhr

am 21. Januar 2023, 17:58 Uhr von ordnanceordinance
nice puzzle. Not sure why the knight rank is necessary though instead of just putting the killer cage total.

- Thanks. It's a theme series of puzzles. I put the knight rank as it's consistent with the other puzzles in the series. Also, having to do a little math adds an extra dimension to the puzzle for a little bit more fun. I hope you enjoyed the puzzle. - Tingo

Schwierigkeit:3
Bewertung:89 %
Gelöst:66 mal
Beobachtet:4 mal
ID:000CO7

Standardrätsel Rätselvariante Variantenkombination Schach

Lösung abgeben

Lösungscode:

Anmelden