Shikakusweeper
(Eingestellt am 21. Januar 2023, 17:14 Uhr von 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.
Lösungscode: 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")
Kommentare
am 27. Februar 2023, 13:39 Uhr von 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.
am 19. Februar 2023, 19:32 Uhr von dennischen
I did not expect the constraints to pair up together so nicely, yet they did :) What a fabulous puzzle.
am 26. Januar 2023, 05:20 Uhr von TJReds
very beautiful puzzle!
am 23. Januar 2023, 16:44 Uhr von peep50183
Very nice idea :)
am 22. Januar 2023, 13:57 Uhr von KusaneHexaku
Update Minesweeper rules to say "mines" instead of "shaded cells"
am 21. Januar 2023, 18:45 Uhr von KusaneHexaku
adjusted star, forgot to change it
am 21. Januar 2023, 18:35 Uhr von PrimeWeasel
Enjoyable, but certainly not a 3 star!
