Logic Masters Deutschland e.V.

Max Arrows

(Published on 3. March 2023, 01:19 by antiknight)


This is an Ambiguous Arrows puzzle with an interesting solve path that I think will be rewarding and hopefully fun. Leave a comment if you enjoy the puzzle and the idea.

Rules:
1) Normal Sudoku rules apply:
Place the digits 1-9 into each cell of the grid. None of the rows, columns or boldly outlined 3x3 boxes contain repeated digits.

2) Modified Arrows rules apply:
For each arrow, the solver must determine if it is a normal or a max arrow. If an arrow branches then all it's branches belong to the same type.

Normal Arrows: The digits along each arrow must sum to the digit in the circled cell. Digits may repeat along an arrow if permitted by other rules.

Max Arrows: The digit in the circled cell is the max digit, and must appear on one of the arrow cells. All other digits along the arrow must be smaller than the max digit.



Solve Online:
F-Puzzles Link
CTC App Link

Solution code: Row 2 followed by Column 9

Last changed on on 3. March 2023, 16:55

Solved by bansalsaab, gigglingCaduceus, Xalothros, Gryllulus, lerroyy, StefanSch, SKORP17, Iluvsodah, cmb, cdwg2000, lianarox, AvonD, tangobunni, flyjim, dlindberg3, brimmy, LUORISHENHAIA, randall, Crusader175, salamis99, hibye1217
Full list

Comments

Last changed on 3. March 2023, 16:50

on 3. March 2023, 16:35 by peterkp
Can you please clarify the rules? For Max Arrows you say, "must appear on the line." What line? I don't understand.

- I'll reword the explanation but basically the max digit needs to appear on the arrow cells and all the other digits on the arrow cells are smaller than the max digit.

Last changed on 3. March 2023, 16:51

on 3. March 2023, 13:41 by lerroyy
Very nice puzzle, thanks!

- Thanks I'm happy you liked the puzzle

Last changed on 3. March 2023, 16:50

on 3. March 2023, 03:12 by gigglingCaduceus
Very nice solve path!

-Thanks I really appreciate it .

Difficulty:4
Rating:94 %
Solved:21 times
Observed:6 times
ID:000D5G

Puzzle variant Online solving tool

Enter solution

Solution code:

Login