Logic Masters Deutschland e.V.

Sudoku Variants Series (186) - Sudoku and Dragons

(Published on 20. June 2017, 00:00 by Richard)

For this Sudoku Variants Project I have planned to publish a different Sudoku variant every Tuesday. I will see how long it takes before I am running out of ideas.

Sudoku and Dragons
Place the digits from 1 to 8 in the empty cells so that no digit is repeated in any row, column and outlined 3x3-block. There are nine dragons (D) in the grid. Every dragon can look in four directions and sees the digits 1 to 8 exactly once. Dragons cannot look behind the thick grey walls.

Inspiration for this type comes from Special 8 Sudoku Test (LMI).

Solve online in Penpa+ (thx Nick Smirnov!)

Solution code: Row 5, followed by Column 7 (ignore the dragons).

Last changed on on 14. August 2022, 08:11

Solved by tuace, dm_litv, Hemant, Luigi, Statistica, zorant, flaemmchen, Senior, lubosh, AnnaTh, rcg, marcmees, Jochen, jessica6, Carolin, jirk, Zzzyxas, KlausRG, Rollo, deu, Saskia, CHalb, moss, skypper, ... Nick Smirnov, geronimo92, bbutrosghali, misko, Simpall1, Greg, ksoekarjo, AMD, snowyegret, TomBradyLambeth, Angelo, PetLov, Nickyo, Raistlen, Gotroch, mjozska1985, CGeom, juventino188, CJK, Saskia11
Full list

Comments

on 14. August 2022, 08:11 by Richard
Added tag and link for online solving. Thx Nick!

on 15. September 2021, 00:34 by Nick Smirnov
Penpa:
https://git.io/Ju5DA

on 22. June 2017, 20:50 by pin7guin
Spannende Kombi! Danke, Richard!

on 22. June 2017, 09:11 by ibag
Das hat mir supersupergut gefallen!

Last changed on 20. June 2017, 07:01

on 20. June 2017, 06:58 by Richard
Thx dm_litv!

on 20. June 2017, 06:56 by dm_litv
One more typo in the solution code description (english variant) - should be "Row 5" (not 1).

on 20. June 2017, 05:52 by Richard
Typo fixed in the solution code.

Last changed on 20. June 2017, 02:14

on 20. June 2017, 02:12 by dm_litv
Something is wrong with the solution code.

Difficulty:2
Rating:88 %
Solved:105 times
Observed:13 times
ID:0002N8

Puzzle variant Online solving tool

Enter solution

Solution code:

Login