Logic Masters Deutschland e.V.

Alternating Universe

(Eingestellt am 22. Oktober 2021, 02:32 Uhr von BellBear)

In my first ever published puzzle I used alternating sums to disambiguate the solution without giving too much away early on. Here the interaction of alternating sums and arrows are the main idea of the puzzle.

Rules
  • Normal arrow sudoku rules apply (normal sudoku rules apply and numbers on an arrow sum up to the number in the attached circle).
  • On the blue line the outer digits sum to the central digit.
  • Numbers outside the grid give the alternating sum of that row/column. The alternating sum is calculated by alternately adding and subtracting numbers (e.g. if you have a row of 873 614 529 - in that order - ist alternating sum is 8-7+3-6+1-4+5-2+9 = 7).
  • The numbers within cages - read from left to right or from top to bottom - are divisible by the clue in the top left corner (for dividibility rules look below the puzzle). Note: it's not about the sum of the digits in the cage but just the number read as a decimal number in this cage.
Link to this puzzle in F-Puzzles

Link to this puzzle in CTC app

Divisibility rules
  • A number is divisible by 3 if its digital sum (=sum of all digits) is divisible by 3.
  • A number is divisible by 11 if its alternating sum is divisible by 11.

Lösungscode: Row 1 followed by column 6 (18 digits, no spaces)

Zuletzt geändert am 10. Januar 2022, 15:11 Uhr

Gelöst von SKORP17, purpl
Komplette Liste

Kommentare

Zuletzt geändert am 10. Januar 2022, 15:12 Uhr

am 10. Januar 2022, 15:11 Uhr von BellBear
After a discussion with purpl I decided to modify the rules descriptions a little bit.

am 29. Oktober 2021, 17:44 Uhr von uvo_mod
Labels angepasst.

am 23. Oktober 2021, 23:34 Uhr von BellBear
I changed the solution code description.

am 23. Oktober 2021, 21:52 Uhr von BellBear
Just some html stuff

am 23. Oktober 2021, 21:49 Uhr von BellBear
Lösungscode angepasst

Schwierigkeit:4
Bewertung:N/A
Gelöst:2 mal
Beobachtet:3 mal
ID:00080U

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden