i think a few had already been in flight when biden started shooting them down. and even with navigation, seems they would take weeks to return to china the long way
My favorite fact about Minesweeper is that it is something like 99.99% solved. But if you could solve the last little remaining bit (or show it can’t be solved), you would have effectively solved one of the worlds most challenging math problems (P=NP) and win a million dollars.
Spy balloons are helpful for signal intelligence: monitoring electronic communication. Satellites fly too high to pick up some of that. The US does a lot of that using manned aircraft.
But basically problems where you have to take the whole grid into place are difficult to solve, and there are peculiar positions that can really only occur in large grids that would work like logic gates which makes it even harder to solve quickly
I think I’m too dumb for anything beyond like halfway down page 3 in that paper.
I guess maybe the problem is that I don’t know what “solved” means in this context (especially in regards to it’s 99.99% solved, but not 100% solved).
Like I know, say, tic-tac-toe is solved, because there’s a certain set of moves that can guarantee a draw every time. Is it like that? I assume so, but there’s some connection I’m not getting.
Yeah I admit I don’t fully understand the problem either when you start getting into the insane details.
Well like the other example I’ve heard of is the traveling salesman problem. Say you have a salesman that wants to travel between 200 cities. There is an efficient algorithm that is within 99% of the optimal results. But if you want the optimal result you have to brute force it which is not efficient at all.