Shikakusweeper
(Published on 21. January 2023, 17:14 by KusaneHexaku)
Minesweeper
Place a mine into some cells so that each digit has that many mines within its 8 neighbouring cells. Digits may not be mines.
Shikaku
Divide the grid into rectangular regions so that each region contains exactly one digit, and digits matches the size of the region they're in.
Solve on Penpa+
Use the green Edge line for Shikaku, and the Minesweeper tool under Composite for Minesweeper.
Solution code: For each blue ? in reading order, what number it actually is, and how many mines are in its region, as a pair of digits.
(e.g. a ? which is actually a 3 that has 1 mine in its region is entered as "31")
Comments
on 27. February 2023, 13:39 by Drawoon
If anyone else is confused, only the circles should have numbers in them. You do not need to fill every cell with a number or a bomb. You need to fill the circles with numbers, and the rest should have bombs or remain empty.
on 19. February 2023, 19:32 by dennischen
I did not expect the constraints to pair up together so nicely, yet they did :) What a fabulous puzzle.
on 26. January 2023, 05:20 by TJReds
very beautiful puzzle!
on 23. January 2023, 16:44 by peep50183
Very nice idea :)
on 22. January 2023, 13:57 by KusaneHexaku
Update Minesweeper rules to say "mines" instead of "shaded cells"
on 21. January 2023, 18:45 by KusaneHexaku
adjusted star, forgot to change it
on 21. January 2023, 18:35 by PrimeWeasel
Enjoyable, but certainly not a 3 star!
