Logic Masters Deutschland e.V.

Low Effort Garbage #1

(Published on 14. August 2024, 22:36 by 10feet)

Low Effort Garbage #1

An anti-knight XV Kropki pairs Sudoku

Rules

  • Normal Sudoku rules apply. Place the digits 1 through 9 in each empty cell. Digits must not repeat within the same row, column, or box.
  • Digits must not repeat in cells that are a chess knight's move apart.
  • A black dot between cells indicates cell values with a 2:1 ratio. A white dot between cells indicates cells with consecutive values. Not all dots are shown.
  • Adjacent cells connected with an X must sum to 10. Adjacent cells connected with a V must sum to 5.

Links

Solution code: 1st row


Solved by Miaocik, Klvsched, ole-1995a, GrumpyMan, MontanaPearl, jguer, pkratz22, dingledork, Dermerlin, cmigas, Jowser, JayBird, annnz, gdc, Hajuhn, Bulkystapler, jalebc, ArmagedDan, apendleton, ... Onyx, ManuH, agenthans, BlackApolloX, Dez256, jimblek, Isfan, ellamackmitch, Chipmunk, Carolin, Crul, forsen, Drawoon, bbutrosghali, kross, TroublesomeOrca, THef of Time, Sileem, drifting, timww572
Full list

Comments

on 19. August 2024, 18:30 by Tingo
This was a fun little piece of puzzling. Thanks for setting and sharing!

on 18. August 2024, 17:04 by chain.reader
no garbage here,
though this only needed a tiny bit of colouring near the end to sort through the 579s

Last changed on 17. August 2024, 04:29

on 17. August 2024, 04:29 by 10feet
No, a negative constraint like that should be explicitly mentioned in the rules. The clarification for the Kropki rules is in place because standard Kropki rules do use the negative constraint, but I am not aware of that being a standard or even common rule for XV.

on 16. August 2024, 08:54 by asp1310
Are all Xs and Vs shown? I'm guessing yes(?), since you explicitly mention that not all Kropki dots are shown.

on 15. August 2024, 12:02 by permafrostyx
yay

on 14. August 2024, 23:32 by Klvsched
solid garbage imo

Difficulty:1
Rating:88 %
Solved:123 times
Observed:1 times
ID:000JD4

Variant combination Online solving tool

Enter solution

Solution code:

Login