Logic Masters Deutschland e.V.

Meinsweeper

(Eingestellt am 24. Juni 2024, 20:01 Uhr von fjam)

Take care with this puzzle, or you might end up going in circles!
  • Normal Sudoku rules apply.
  • Adjacent digits on German Whispers lines must have a difference of at least 5.
  • A digit in a circle indicates the length of the longest orthogonally connected German Whispers line that can be drawn in surrounding cells; orthogonally and diagonally adjacent cells, but not the cell itself.

A 4x4 example puzzle, where adjacent digits on German Whispers lines must have a difference of at least 2, is shown below which can be solved in SudokuPad:


The length of a line is the number of line segments required to draw it. Therefore, a line entering N cells around a clue has length N-1, unless it is a closed loop which would have length 8. Only relevant lines are shown in the example solution.

Löse SudokuPad

Lösungscode: Zeile 8, Zeile 9


Gelöst von filuta, chameleon, SKORP17, anonymoose, wisty, tuturitu, Jesper, Christounet, sanabas, Jds2, mormagli, peacherwu2, henrypijames, tonald, Bellsita, fajoogaloo, Myxo, Niverio, Sewerin, PippoForte, WedgeOfCheese, Silverstep
Komplette Liste

Kommentare

am 24. Juli 2024, 23:41 Uhr von Myxo
Great puzzle!

am 26. Juni 2024, 20:37 Uhr von mormagli
Fun & novel logic, thanks!

am 26. Juni 2024, 05:40 Uhr von sanabas
Lovely logic all the way through

am 25. Juni 2024, 09:22 Uhr von Christounet
Relentless indeed ! The way the clues work (with a tiny bit of sudoku magic along the way) is really cool. Thanks :)

am 24. Juni 2024, 23:52 Uhr von wisty
Really fun ruleset! One of the nicest 4x4 example puzzles I've seen, followed by the classic fjam execution of a relentless but fascinating main course.

Zuletzt geändert am 24. Juni 2024, 20:29 Uhr

am 24. Juni 2024, 20:07 Uhr von filuta
the essence of sudoku - some puzzles are beautiful despite being sudoku, this one is beatiful because it is a sudoku :o)

Schwierigkeit:5
Bewertung:90 %
Gelöst:22 mal
Beobachtet:9 mal
ID:000INN

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden