Logic Masters Deutschland e.V.

Bittersweet

(Eingestellt Heute, 14:40 Uhr von pmays123)

Bittersweet, by pmays123

  • Place the digits 0-8 once in every row, column, and box.
  • Region Sum Lines: Box borders divide blue lines into segments with the same sum. Different lines may have different sums.
  • Bricks: Exactly one cell in every row, column, and box is a brick. Brick cells contain no digits, and if a brick cell sits on a line, then that cell no longer belongs to any line. Therefore, bricks may shorten a line or divide a region sum line into two new valid region sum lines (note: these new lines may have different sums). Valid region sum lines occupy at least two boxes.
  • S-cells: Exactly one cell in every row, column, and box contains two digits. For the purposes of other constraints, the value of an S-cell is the sum of its two digits.
  • Inequality Sign: The inequality sign points to the lesser of the two values it sits between. If a brick sits on one of these cells, then the inequality sign is ignored.

(note: solution check works when no digits are entered in bricks or S-cells)

Link to Puzzle: SudokuPad

Good luck, and I hope you have a beautiful day! :)

Lösungscode: Row 8 (left to right). For bricks use "/", and for S-cells enter the smaller digit first. Example solution code: 012/345678

Zuletzt geändert Heute, 20:29 Uhr

Gelöst von elektriktoad
Komplette Liste

Kommentare

Heute, 22:27 Uhr von elektriktoad
Wonderful puzzle. The variant rules make you think about region sums quite differently.

Heute, 20:29 Uhr von pmays123
fixed solution code

Schwierigkeit:4
Bewertung:N/A
Gelöst:1 mal
Beobachtet:0 mal
ID:000VOC

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden