Logic Masters Deutschland e.V.

◇◇ XV ◇◇

(Eingestellt am 15. August 2026, 14:59 Uhr von Mr SD)

Puzzle can be attempted here.

Normal sudoku rules apply - each row, column and 3x3 box must contain the digits 1-9 with no repeats.

Cells separated by a V sum to 5; cells separated by an X sum to 10.

Draw a line through the 9x9 grid, starting and ending at the two grey circles in R1C1 and R9C9 (direction to be determined). The line may only move orthogonally between cells and may not cross itself.

Coloured diamonds split the line into distinct segments. Segments connected by a diamond are the same length (i.e. they have the same number of cells) unless the effect of a diamond changes this (for the avoidance of doubt, only segments connected by a Cyan or Yellow diamond will be of different lengths).

All 15 diamonds must be visited, and each diamond colour has a different property, as follows:

- Red: The two connected segments have the same number of cells in the row of the diamond, and the sum of the cells in that row is the same.

- Green: The two connected segments have the same number of cells in the column of the diamond, and the sum of the cells in that column is the same.

- Blue: The two connected segments have the same number of cells in the 3x3 box of the diamond, and the sum of the cells in that box is the same.

- Cyan: The next segment grows or shrinks to be exactly one cell longer or shorter than the previous segment.

- Purple: The digits in the next segment are identical to those in the previous segment, but may appear in any order.

- Yellow: The value of the next segment when read as a single integer along the path is double or half the value of the previous segment when read the same way (see following examples: Example #1 Example #2 )

Lösungscode: Column 5 top to bottom and row 5 left to right (18 digits total)

Zuletzt geändert am 15. August 2026, 15:12 Uhr

Gelöst von PierreTombal, kangaroo
Komplette Liste

Schwierigkeit:4
Bewertung:N/A
Gelöst:2 mal
Beobachtet:0 mal
ID:000UDA

Neu

Lösung abgeben

Lösungscode:

Anmelden