Logic Masters Deutschland e.V.

真笑Puzzles041--Wall Sudoku

(Eingestellt am 29. Januar 2022, 13:40 Uhr von cdwg2000)

Authorized by the author 真笑(洪卫华), he plans to publish his hand-made puzzles on this website, If you like it and have good suggestions, you can leave a message.I hope you can laugh innocently, really laugh every day!

Author: 真笑(洪卫华), from China, this question comes from his personal blog.


Wall sudoku

This puzzle is a variant of a Consecutive Sudoku as a Wall puzzle. It was inspired by Phistomefe's puzzle Wall Sudoku.

1.Each row, column 3x3-box contains each digit from 1 to 9 exactly once;

2.Place a wall between all orthogonally adjacent cells that contain consecutive digits;

3.A given digital clue indicates how many cells it can see in horizontal and vertical direction including its own cell. Wall obstruct the view;

4.One of given digital clue must be equal to the number filled in the cell;

5.All possible clues are given.



Click enter Penpa+Thanks Phistomefe.


Lösungscode: Row 1, Coloum 6.

Zuletzt geändert am 7. März 2022, 03:40 Uhr

Gelöst von Jesper, MagnusJosefsson, bernhard, marcmees, Greg, rcg, Steven R, PoiPlexed, starelev5, Dandelo, misko, Beanie, polar, Mody, Uhu, Nytik, Hydalin, derKrampus, Jaych, pandiani42, h5663454
Komplette Liste

Kommentare

am 9. März 2022, 23:37 Uhr von cdwg2000
@Steven R

Thanks.

am 5. Februar 2022, 16:05 Uhr von Phistomefel
Here you go, cdwg2000:
https://tinyurl.com/ycks6ypd

am 5. Februar 2022, 12:58 Uhr von cdwg2000
It would be appreciated if someone could help us with a short link!

am 3. Februar 2022, 11:29 Uhr von Steven R
Really enjoyed it, thanks!

am 30. Januar 2022, 16:09 Uhr von cdwg2000
@Jesper
@MagnusJosefsson
@marcmees

I am glad you like it,thanks.

am 29. Januar 2022, 18:09 Uhr von marcmees
very nice. thanks.

am 29. Januar 2022, 16:56 Uhr von MagnusJosefsson
Very nice puzzle!

am 29. Januar 2022, 16:19 Uhr von Jesper
Great puzzle, really fun, thanks!

Schwierigkeit:4
Bewertung:97 %
Gelöst:21 mal
Beobachtet:2 mal
ID:0008YS

Rätselvariante Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden