The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time). P versus NP problem – Wikipedia
For predictions I can see a similarity from this P versus NP problem. The idea is simple.
If you can picture an area where the solution might be confined in then you can ?quickly test if any of those small predictions or points are valid.
It should be easier to find probable wrongs with your initial guess than trying to find the perfect solution right away. This way you can program an algorithm to sort out initial guesses that are not so good. Left are then some strong candidates.