The recipe seems to be, pick a problem whose solution is highly verifiable, then throw the equivalent of ten billion hours of expert-level thought at it. If you can narrow the search space a lot, all the better. P != NP is sure to follow soon enough.
Their last two examples are extremely verifiable.
> P != NP is sure to follow soon enough
Not an expert, but from comments I've heard by experts P != NP is much further out of reach than Riemann. Eg, Scott Aaronson:
> First, almost no one in theoretical computer science—not counting the cranks, whose missives fill my inbox every week!—spends their time directly trying to prove P≠NP. Why not? For the same reason why you wouldn’t embark on a manned mission to another galaxy, if you hadn’t even set foot on Mars yet.