Logic Masters Deutschland e.V.

Chaotic Chess

(Eingestellt am 30. Mai 2025, 22:09 Uhr von Belamis)

Chaos Construction: Divide the grid into regions, each consisting of nine orthogonally connected cells. Each row, column and region contain the digits 1-9 once each.

Killer: Digits do not repeat in cages, and sum to the small clue in the top left corner if given.

Each cage contains exactly 1 region.

The digit in the top-left cell in a region (Leftmost cell in the top row) counts the number of cells a knights move away that share a region with that cell.

In addition, the top-left cell in a region counts the number of cells a bishops move away that share a region with that cell (Not counting the cell itself, and where other regions block view).

SudokuPad link

Lösungscode: Row 8, with a - between region borders


Gelöst von krytolandros, cryptique, Eespi, Nylimb, wenchang, marcmees, blueberrypug, erml, Snookerfan, redgecko, mayiyang, steeto, jkuo7, halakani, Sktx, Rafje, Piff, jmw, bansalsaab, Dentones, Maximus, ... Clara123, widjo, oskode, tonald, misko, AzuriteFish, adimadi, Martijn314, kmoter, Jorrr2, elpadrinoIV, lucymzme, zakkai, numpty, 999ARMEN999, RubberMittens, anotherpaulistring, skwylcy, ab3defc
Komplette Liste

Kommentare

Zuletzt geändert am 3. Juni 2025, 07:14 Uhr

am 2. Juni 2025, 21:36 Uhr von saturnic
I seem to be stuck: the 21 cage the minimum digit i can place in the top-leftmost cell is a 4, which (in my logic) means that i need to add four knights move cells + four bishop move cells + this inicial cell with a 4, completing the 9 cells i need, but i can't see how to orthogonally connect them, i always need at least one more cell. Am i missing something? this is a very interesting puzzle to me and i would like to be able to approach it. Thanks in advance
---------------------------------------------
Correct - The lowest digit in the 21 cage is 4, meaning that none of those 3 cells may be the top left cell of the region they belong to. I am not sure where you are up to, but a hint for starting is to find a cell that needs to be the top left of it's region. Hope you enjoy :)

am 31. Mai 2025, 20:40 Uhr von Nylimb
Thanks for a great puzzle! I found it to be not too difficult, once I realized that "each cage contains exactly 1 region" actually means that each cage is contained in a single region.

am 31. Mai 2025, 11:06 Uhr von Snookerfan
Brilliant puzzle! Lovely break-in, smooth afterwards. Thank you

am 31. Mai 2025, 10:01 Uhr von erml
So many beautiful deductions, thank you!

am 31. Mai 2025, 07:13 Uhr von marcmees
some nice chess logic for a smooth cc construct. thanks

am 30. Mai 2025, 23:30 Uhr von krytolandros
Great puzzle! Smooth logic that was never too hard. 4* in difficulty for me.

Schwierigkeit:4
Bewertung:96 %
Gelöst:63 mal
Beobachtet:5 mal
ID:000NLM

Variantenkombination

Lösung abgeben

Lösungscode:

Anmelden