Logic Masters Deutschland e.V.

The Ten-Legged Spider (Anchor Sudoku)

(Published on 10. June 2021, 15:28 by FryTheGuy)

The Ten-Legged Spider

(actually it is a solifugae)

This is the second puzzle in a series of seven anchor sudoku puzzles.

Anchors are like arrows, except you subtract the smallest digit from the sum of the other digits. So for example an anchor with a 5 in the square, and 4,2,3 in the chain would be valid because 5=4+3-2. Repeat digits are allowed so 5,5,1,1 would also be valid because 5=5+1-1.

Previous Puzzles
Rules

Standard sudoku rules apply.

Subtracting the smallest number along an anchor from the sum of the other numbers equals the number in the square cell.

Solve the puzzle at https://f-puzzles.com/?id=yxvepdw9

Solution code: Columns 1 and 2

Last changed on on 11. June 2021, 00:02

Solved by polar, Piatato, Yerui, bigger, Vebby, Bobbobert
Full list

Comments

on 22. October 2021, 13:19 by uvo_mod
Labels ergänzt.

on 11. June 2021, 03:35 by FryTheGuy
@Piatato

Happy to hear you liked it! I tried to make the solving path as different as possible across all 7 puzzles, hopefully you keep finding them interesting.

on 11. June 2021, 01:33 by Piatato
Again, a very interesting puzzle with this new constraint. I'm glad I got to practise this a bit in your previous puzzle! Looking forward to see what else you've got in store!

on 11. June 2021, 00:05 by FryTheGuy
@polar

I am really glad you solved it. I underestimated the difficulty because I have already internalized a lot of the "obvious" deductions with anchors. In retrospect this probably was not the best choice for the second puzzle with the rule set.

on 11. June 2021, 00:02 by FryTheGuy
Increased difficulty to 4 stars

on 10. June 2021, 21:21 by polar
Lovely puzzle! Probably closer to a 3.5/4* for me, as I found it very easy to make mistakes and the rules aren't so intuitive (yet). Look forward to the next ones :)

Difficulty:4
Rating:N/A
Solved:6 times
Observed:8 times
ID:0006LK

Puzzle variant Online solving tool

Enter solution

Solution code:

Login