Logic Masters Deutschland e.V.

Minimum and Maximum Dominos

(Published on 23. June 2025, 17:52 by Md88keys)

Minimum and Maximum Dominos

by Md88keys

 

Play in Sudokupad

 

 

Normal sudoku rules apply.

Digits in a cage sum to the given number.

Cages indicate the minimum and maximum sums of orthoganally connected pairs of cells within a box.

Negative constraint: All minimum and maximum cages within a box are given. There cannot be a domino that sums to a number less than the minimum cage, nor can there be a domino which sums to a number greater than the maximum cage. There cannot be a domino equal to the minimum or maximum, unless it also is marked with a cage.

Solution code: Column 2 top to bottom


Solved by StefanSch, jalebc, SKORP17, Joyofrandomness, henter, Exigus, M8tyw31, Qodec, Sudoku Lukas, alexsmart, cmigas, tryote, Imperial Marcher, Blummy, Ungesundheit, fuxia, harwiltz, brandon_bot, samuella, ... dzamie, MaxSmartable, Chiefredhawk, apendleton, adam001, Tompzini, paranoid, IDEK, addie, Lovejoy , Ye Nay Myo Han, Crusader175, Uhu, timww572, wacfwaef, Johanic, Frank Puzzles, jupp, meowng
Full list

Comments

on 26. June 2025, 00:31 by dzamie
Took a couple of read-throughs to really understand what the negative constraint meant. Really cool variant! Always fun to discover new ways to narrow down options.

on 24. June 2025, 16:02 by Jeraldo82
Loved it!

on 24. June 2025, 14:29 by atliruyalar
I didn't see the negative constraint rule and stuck for about half an hour looking and not understanding how to do it. With the negative constraint it is a very lovely puzzle thank you!!

on 24. June 2025, 12:47 by 2xdula
Very interesting puzzle and really nice flow

on 24. June 2025, 07:07 by MSDOS
Really unique and interesting variant on killer cages! Very enjoyable!

on 24. June 2025, 06:14 by AngryH0bb1t
Really enjoyed solving this. Thanks for setting it! Fun rule set.

on 23. June 2025, 19:54 by Qodec
Marvellous!

on 23. June 2025, 18:03 by StefanSch
Nice!

Difficulty:2
Rating:94 %
Solved:89 times
Observed:3 times
ID:000NX7

Enter solution

Solution code:

Login