Logic Masters Deutschland e.V.

Kropki v1

(Eingestellt am 1. August 2023, 17:33 Uhr von KundeShane)

Rules:

  • Normal sudoku rules apply. The digits 1 through 9 must appear in every row, column, and 3x3 box.
  • Cells separated by a white dot contain consecutive digits.
  • Cells separated by black dot have a ratio of 2:1.

Eric's F-puzzles link: Click Here

Sven's CTC App: Click Here

Lösungscode: Column 5 from top to bottom


Gelöst von jalebc, tuturitu, IAM3, henter, cathematician, Sonki, SKORP17, WarriorKitten, mathpesto, ScatterBrain, AN_not_IO, fuxia, WatermeRen, efnenu, Uhu, kporadzinski, PinkNickels, Keagan, LehanLehan, ... obi, MarthaB, TaeChi, Jordan Timm, jchan18, 99jau99, El1247, chanelaw, lmdemasi, Carolin, BlackApolloX, Jodelbanane, snuuba, dingledork, zhergan, bergelfe, trashghost, mainakdatta, PippoForte
Komplette Liste

Kommentare

am 10. August 2023, 17:57 Uhr von KundeShane
For questions involving negative constraint. I choose to leave out mention of a possible negative constraint because there is a solution path without knowing if all dots are given or not.

am 5. August 2023, 13:40 Uhr von asp1310
Are all dots given? This is usually something it's best to state in a puzzle like this.

Alternatively, if you'd like the solver to work out whether this is the case or not, you could say something like "The solver must determine if all dots are given."

But leaving that question completely blank can end up being a little confusing which it is!

am 1. August 2023, 19:38 Uhr von WatermeRen
Kropki has become one of my better constraints, I struggle with 2 star indexing and snake etc, but I found this pretty easy so maybe 2 stars?

Zuletzt geändert am 1. August 2023, 20:59 Uhr

am 1. August 2023, 19:25 Uhr von ScatterBrain
Thanks for the puzzle. It was not too difficult. I gave it 2 stars!

--
Thanks for trying my puzzle! I am fairly new to setting, so not really sure how to assign difficulty to something I create.

Schwierigkeit:2
Bewertung:85 %
Gelöst:87 mal
Beobachtet:2 mal
ID:000EOK

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden