Logic Masters Deutschland e.V.

Easy Arrows 2

(Eingestellt am 6. April 2022, 21:12 Uhr von EricRathbun)

  • Normal Sudoku rules apply.
  • Normal arrow rules apply.
  • Digits separated by a black dot are in a 1:2 ratio. Not all dots are given.
  • Digits separated by a knight's move in chess do not repeat.

The puzzle can be played here:

f-puzzles

Hope you enjoy the puzzle. Comments appreciated.

Lösungscode: Top row


Gelöst von idanz, PinkNickels, Gramor, jorgenunez, Guillem98, MB_Cyclist, RickHoffman, Marcos, cbattles, McKillers, Wlam, SKORP17, jhuijts, Failure, dskaff, root_vegetable, avishai, Squiz, brandon_bot, ashwin, ... zrbakhtiar, Skals, Askloomok, lukeyy, DiMono, Matt Johnson, geronimo92, senfpapa, Clashkiller2000, TheIronDuckling, Cnidarian, lapazhu, PetLov, elnahal, Megalobrainiac, bolado, pepe74287, apendleton
Komplette Liste

Kommentare

Zuletzt geändert am 8. April 2022, 23:48 Uhr

am 8. April 2022, 17:27 Uhr von blackgold
Nice and smooth flow thanks for setting it up.
---
Response from Eric: Thanks Blackgold.

Zuletzt geändert am 7. April 2022, 13:25 Uhr

am 7. April 2022, 11:40 Uhr von ScatterBrain
I was having trouble at the beginning, and then I realized I was thinking thermos instead of arrows! Thanks for making.
---
Response from Eric: Yes, that would make a big difference. Glad you got it.

Zuletzt geändert am 7. April 2022, 10:20 Uhr

am 7. April 2022, 07:54 Uhr von Gullie
Very nice and easy puzzle. I found the logical path to be very elegant.
---
Response from Eric: Thanks Gullie. Glad you liked it and good to hear from you.

Zuletzt geändert am 7. April 2022, 10:21 Uhr

am 7. April 2022, 04:47 Uhr von Markyboy
Yes colour the 1s and 2s to get progress. Not sure I broke it twice. 3rd attempt, easy in 15mins....maybe I was not concentrating enough before, because it was a logical path. Good puzzle
----
Response from Eric: Thanks Markyboy. Glad you liked it.

Schwierigkeit:2
Bewertung:88 %
Gelöst:112 mal
Beobachtet:4 mal
ID:0009AP

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden