A very fun game, it feels like a more "computationally intense" minesweeper, though I guess I compare everything to minesweeper[1][2]! It seems the optimal str

A very fun game, it feels like a more "computationally intense" minesweeper, though I guess I compare everything to minesweeper[1][2]! It seems the optimal strategy is to initially try to ferret out which dots are in the solution set and which are not in the solution set via broad non-overlapping sweeps followed by slight pattern deviations to determine membership of particular dots. Depending on luck and your errors, this might take a half dozen moves, it might take two dozen. Once you know which dots are in the solution set and which are outside, I find it takes less than 5 additional moves to determine order. For this part, a pencil and paper for tracking the elimination of certain dots from certain orders made this phase consistently quick. Is very fun, I was ultimately able to beat the medium difficulty setting in an average of 15 attempts per game. [1] - https://github.com/lelandbatey/defuse_division https://github.com/lelandbatey/defuse_division [2] - https://github.com/lelandbatey/minesweeper-solver https://github.com/lelandbatey/minesweeper-solver