Logic Masters Deutschland e.V.

真笑Puzzles028--69Sandwich(2)-Double Sandwich

(Published on 20. February 2021, 15:30 by cdwg2000)

Authorized by the author 真笑(洪卫华), he plans to publish his hand-made puzzles on this website, If you like it and have good suggestions, you can leave a message.I hope you can laugh innocently, really laugh every day!

Author: 真笑(洪卫华), from China, this question comes from his personal blog.

This is a new variant of Sandwich Sudoku. It is created using the variable order of the sandwich numbers. It is also the second question of the series. There may be more interesting combinations of variants later.
The latest question:

69Sandwich(1)
69Sandwich(2)
69Sandwich(3)
69Sandwich(4)
69Sandwich(5)
69Sandwich(6)
69Sandwich(7)


69Sandwich Sudoku--Double Sandwich
1. Classic Sudoku rules apply;
2. If the number 1 appears in front of the number 9, the sum of all the numbers between them is marked on the outside (left or upper black);
3. If the number 2 appears in front of the number 8, the sum of all the numbers between them is marked on the outside (left or upper gray).




Click enter to Penpa+

Solution code: Row 9,Coloum 5.(A total of 18 numbers).

Last changed on on 24. December 2021, 15:43

Solved by Dandelo, marcmees, ManuH, Jesper, rimodech, Jds2, Franjo, Thomster, NikolaZ, skywalker, kublai, Frankenfruity, zorant, Statistica, logik66, saskia-daniela, llo-7, Julianl, Mody, cornuto, mango, vmirandaa, zrbakhtiar, Saskia
Full list

Comments

on 20. February 2021, 23:28 by cdwg2000
@Dandelo

Glad you like this idea! Restricting the order of the number of sandwiches can reduce the difficulty of the question. Correspondingly, some combined variants will be derived. This is the second question in the series. There may be two different interesting variants later. I will introduce them later.

on 20. February 2021, 18:06 by Dandelo
Very good idea, and a very nice puzzle.

Difficulty:2
Rating:91 %
Solved:24 times
Observed:7 times
ID:0005I8

Puzzle variant Beginners Online solving tool

Enter solution

Solution code:

Login