Open wingos80 opened 5 months ago
Run the LS solver multiple times, each time seeding the solver with the clipped of the previous solution vector: $x \in [0,1]$. Might solve the impossible bomb number cases, when $x$ is estimated to be $<0$ or $>1$.
Done with commit https://github.com/wingos80/minesweeper_solved/commit/4047555007fc906013afed6d29b5be6d6af05a53
Looks like solver runs better with this improvement (should benchmark)
Run the LS solver multiple times, each time seeding the solver with the clipped of the previous solution vector: $x \in [0,1]$. Might solve the impossible bomb number cases, when $x$ is estimated to be $<0$ or $>1$.