This is an example of what mathematicians call an NP-hard problem. NP-hard problems are a bit like enormous combination locks: if you’re given a solution it is easy to check if it works, but it would take an impossibly long time to find the solution yourself by systematically trying every combination.
