Snack 5: Zeltplatzsudoku
(Published on 7. March 2011, 13:11 by RobertBe)
Enter numbers from 1 to 'n' into the diagram, such that in every row, every column and every bold bordered area every digit appears exactly once.
On top of that, enter into each row, column and bold bordered area exactly one tree (B - Baum) and one tent (Z - Zelt), so that every tree belongs to exactly one tent, that is located horizontally or vertically adjacent.
Solution code: The third row followed by the fourth column. Use a B for a tree, and a Z for a tent.
Solved by r45, julius64, Realshaggy, Luigi, zorant, MiR, rimodech, ibag, moss, flaemmchen, Kekes, zuzanina, geophil, Errorandy, lutzreimer, Laje6, pin7guin, ffricke, Rollo, pokerke, dm_litv, joyal, CHalb, ... ElimGarak, losingreallybadly, helle, Jordan Timm, Terrapin, Kenji769, Avertos, september, Infludancer, ThirdWiseMonkey, beavr, Arne, Incurrsion, yusuf17, Dez256, jcelia, digital_lighting, k2u5as
Comments
on 6. April 2023, 17:05 by losingreallybadly
Perhaps the instructions would be clearer if it read:
Enter one of: 1, 2, 3, 4, B, or Z into each cell.
(since B and Z aren't technically numbers)
on 26. January 2023, 22:46 by Dandelo
It is easy. Did you notice that it is NOT a standard sudoku?
on 26. January 2023, 19:29 by patolucatis
Why is this so supposedly easy? I can only get in a few numbers, and even after checking with a sudoku solver for next step, it tells me it's trial and error
on 25. January 2023, 00:28 by TJReds
penpa: https://tinyurl.com/2euwhv6k
on 8. March 2011, 17:51 by Mody
Hübscher kleiner Snack
