Based on a puzzle given to us by Jamal Senjaya I created a bigger one. Hope it is not too easy.
The number in circle means how many of adjacent triangles should be painted blue.
I did not mention (I was not aware) that the puzzle has many (I hope not too many) possible solutions. There is one however that "makes more sense" - if you see it you will know that this is it. All valid solutions will earn an upvote (hopefully not only from me), but only "the one" will be accepted. The desired solution can be distinguished by the fact that the resulting image is a 4-letter word.
I actually started at the top with the two 5 nodes and just worked my way around. I did the 0 nodes before messing with the surrounding nodes, then did the 1 nodes, then the other 5 nodes. Everything else was kind of random, but I didn't have to re-do anything.
Blue are "blue" nodes. I used gray to say "this can't be a node" as I went along, then left it that way when I finished.
I made a little program to demonstrate this puzzle. It is an interactive thing that you can click on and off to select "mines". I made blue the color of the safe spots, and red the color of mines. White is simply unselected:
It is the only spots I can prove are filled in that manner.
SatisfiabilityCountwhich only counts the solutions, instead of returning them all. (Getting all of them is much much slower.) $\endgroup$