Talk:Diophantine linear system solving: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 93: | Line 93: | ||
First of all, this algorithm returns bomb tiles tagged as -1 and safe tiles tagged as 0, but I don't know what to make of the +1s in the solution. What do those represent? |
First of all, this algorithm returns bomb tiles tagged as -1 and safe tiles tagged as 0, but I don't know what to make of the +1s in the solution. What do those represent? |
||
Secondly, a bomb is 100% correct if (and only if), on the solution matrix, the rest of the corresponding tile's column has ONLY 0s, which is not the case for any tile, in this example. |
Secondly, a bomb is 100% correct if (and only if), on the solution matrix, the rest of the corresponding tile's column has ONLY 0s, which is not the case for any tile, in this example. |
||
Same for the safe tiles: a tile is 100% safe is the rest of the column contains ONLY 0s. (in this example no perimeter's tile is 100% safe) |
Same for the safe tiles: a tile is 100% safe is the rest of the column contains ONLY 0s. (in this example no perimeter's tile is 100% safe). |
||
This means that, as to be expected, there is no 100% safe solution for this situation, not even a partial one. |
This means that, as to be expected, there is no 100% safe solution for this situation, not even a partial one. |
||
[https://ibb.co/S5N1bvf (image 5)] |
[https://ibb.co/S5N1bvf (image 5)] |
||
| Line 124: | Line 126: | ||
I hope it made some sense. |
I hope it made some sense. |
||
As sayed, I won't keep bothering you guys any further with this frivolous dilemma. I just wanted to clarify that I'm pretty sure THERE |
As sayed, I won't keep bothering you guys any further with this frivolous dilemma. I just wanted to clarify that I'm pretty sure THERE IS a solution... |
||
out there... |
out there... |
||
somewhere... :) |
somewhere... :) |
||