Logic Masters Deutschland e.V.

ArrowPoint

(Eingestellt am 27. November 2025, 15:00 Uhr von Ritsu-chan!!)

Rules:

Jigsaw Sudoku rules apply: Each row, each column, and each irregular region must contain all digits from 1 to 9 exactly once, with no repetitions.

Ratio (Kropki) dots: Cells connected by a black dot must contain digits in a 1:2 ratio (for example, 3 and 6).

Arrows: The digits along an arrow must sum to the value shown in the circle.

Row indexers: A marked cell in row X indicates the row in which the digit X appears within that column.

Puzzle:

Solve it here!

Lösungscode: Row 9, from left to right

Zuletzt geändert am 27. November 2025, 22:35 Uhr

Gelöst von Marshal on Mars, Hierophis69, Qodec, jalebc, Gilliatt, Jafacake, Br1312te, SKORP17, Willkimo, Dermerlin, Nagesh, Counterfeitly
Komplette Liste

Kommentare

am 30. November 2025, 06:56 Uhr von Dermerlin
For me it was very hard. AT LEAST 3 stars.

Zuletzt geändert am 28. November 2025, 19:20 Uhr

am 28. November 2025, 18:21 Uhr von Br1312te
It's possible that I didn't find all the equal sets, but I'm usually quite good at jigsaw sudoku. Even still, there's no way that this is a 1-star sudoku. The time it took me I usually spend on 3-stars.

It's a nice sudoku otherwise!

~~~
Hmm, that's actually quite interesting, because some said that it was too easy haha. Now even I don't know which difficulty this could be.

Zuletzt geändert am 27. November 2025, 22:44 Uhr

am 27. November 2025, 22:37 Uhr von Ritsu-chan!!
Sorry y'all!! There was a typo in the solution. I fixed it now. Again, so sorry for the inconvenience

am 27. November 2025, 20:51 Uhr von SKORP17
Code ?

Zuletzt geändert am 27. November 2025, 22:43 Uhr

am 27. November 2025, 19:47 Uhr von Hierophis69
The solution code does not seem to work.

~~~
Yes, it didn't but now i fixed it. Sorry :(

am 27. November 2025, 19:14 Uhr von jalebc
code?

am 27. November 2025, 18:25 Uhr von jalebc
code?

Schwierigkeit:1
Bewertung:N/A
Gelöst:12 mal
Beobachtet:0 mal
ID:000Q9G

Rätselvariante Variantenkombination Neu

Lösung abgeben

Lösungscode:

Anmelden