Talk:Diophantine linear system solving: Difference between revisions
Content added Content deleted
(Standard C) |
No edit summary |
||
| Line 12: | Line 12: | ||
I needed a way to find ALL possible combinations of bombs, given the constraints of the minefield in a particular situation. |
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. |
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 I am: 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? |
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). |
I hope it makes some sense (my inglysch sucks). |
||