Anonymous user
Talk:Diophantine linear system solving: Difference between revisions
Talk:Diophantine linear system solving (view source)
Revision as of 07:47, 27 February 2022
, 2 years agono edit summary
No edit summary |
No edit summary |
||
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?
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).
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)]
Line 124 ⟶ 126:
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
out there...
somewhere... :)
| |||