Sandwich Order One Up
(Eingestellt am 1. September 2024, 04:11 Uhr von RockyRoer)
This is a variant of Kurchan's "One Up" Puzzles Here's a starting example.
The Rules:
- [One Up] Normal "One-Up" rules apply: Between each pair of walls, place the numbers 1 through n, where n is the length of the space.
e.g. In Row 2, from R2C1 to R2C4, you must place the digits 1-4 once each with no repeats, and in Row 2 from R2C5 to R2C9 you must place the digits 1-5 once each with no repeats.
- [Sandwich]: In each row and column, shade two cells. These cells must contain either the highest or lowest digits in both sections they are in. The clues outside the grid (which must be deduced) represent the sum of the digits between these crust cells.
- Each of the numbers on the side in the "Required Sandwiches" must be used at least once somewhere in the puzzle.
- Each of the numbers in the list of "Forbidden Sandwiches" cannot occur.
The Puzzle:
Try it on Sven's Sudoku Pad. (There is an answer checker, but it only works if you leave the boxes outside of the grid empty.)
Lösungscode: The row or column containing the six sandwich
Gelöst von ClashCode, smckinley, Snookerfan, Jesper, MapleAmber, ZornsLemon, ONeill, Mr_tn, SKORP17, marcmees, Franjo, meixia, Grausbert, lmdemasi, ildiko, Andrewsarchus, Bankey
Kommentare
am 23. Oktober 2024, 16:12 Uhr von Bankey
That was fun. Thanks, @ RockyRoer :).
am 2. September 2024, 15:52 Uhr von Franjo
Very unusual ruleset, but a perfect setting leading to the unique solution. Almost incredible! I loved how the sandwich constraints came in. Thank you so much for creating and sharing such a gem.
am 1. September 2024, 17:15 Uhr von ONeill
Fun puzzle!
am 1. September 2024, 12:11 Uhr von Snookerfan
Great fun! Thank you