Logic Masters Deutschland e.V.

Advanced Kinematics (Projected Sum Arrow)

(Eingestellt am 6. April 2022, 20:08 Uhr von tallcat)

Third in a series of projected sums puzzles, this time with arrows. Please leave a comment if you enjoyed. Happy solving!

Normal Sudoku rules apply

Arrows: Digits on arrows must sum to the digit in the circle. Digits may repeat if allowed by other rules.

Projected Sums: Clues outside the grid give the total sum of digits on arrows/circles in that row or column.


Can be found at f-puzzles or CTC

Lösungscode: Row 3 (left to right) and column 8 (top to bottom). 18 digits, no spaces.

Zuletzt geändert am 6. April 2022, 20:13 Uhr

Gelöst von Piatato, Vebby, OutOfMyMindBRB, antiknight, cmb, abed hawila, ___, SKORP17, h0_0man, Jesper, dlindberg3, Tilberg, tlepetit, Annunakki, galgamer, Nityant5, DVFrank, kmoter, Niverio, Playmaker6174, Muhammad, AvonD, Azumagao, Megalobrainiac, karlmortenlunna, Christounet, Bellsita, Bjd, Bobbobert, jalebc
Komplette Liste

Kommentare

am 29. August 2023, 14:17 Uhr von Christounet
Very hard midsolve again ! Harder than the break-in, with very tiny deductions adding up to reach the finale. Thanks.

am 29. Juli 2022, 17:20 Uhr von Playmaker6174
Very tough nut, but hidden in itself was a basket full of fruitful interactions. This one almost broke my patience half-way in, but luckily that one clue fixed the issues.

am 6. Mai 2022, 15:14 Uhr von Niverio
Lovely break-in. Almost out of the barrel.

am 7. April 2022, 16:18 Uhr von ___
fantastic puzzle, loved the break in especially. thanks tallcat!

am 7. April 2022, 01:06 Uhr von antiknight
Some beautiful deductions at the start ! Quite a hard puzzle. Thanks

am 7. April 2022, 00:40 Uhr von Vebby
Very nice! Some surprising yet delightful deductions. Thanks Tallcat! :)

am 7. April 2022, 00:26 Uhr von Piatato
Hard yet very beautiful puzzle at every turn!

am 6. April 2022, 20:13 Uhr von tallcat
Corrected mistake in instructions

Schwierigkeit:5
Bewertung:89 %
Gelöst:30 mal
Beobachtet:6 mal
ID:0009I0

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden