Anonymous user
Talk:Diophantine linear system solving: Difference between revisions
Talk:Diophantine linear system solving (view source)
Revision as of 11:33, 25 February 2022
, 2 years agono edit summary
(Standard C) |
No edit summary |
||
Line 12:
I needed a way to find ALL possible combinations of bombs, given the constraints of the minefield in a particular situation.
Sadly enough this method gives only one solution. One valid solution, but not necessarily the correct one.
So mine is the question of the lazy person that I am (read "math impaired"): where do I need to look in this procedure to find something to change in order to being able to obtain all the possible solutions, not just one of the simplest?
I hope it makes some sense (my inglysch sucks).
| |||