The constraints imposed on solving complex problems and their solutions can be categorized in problem-solving models such as Sharp P and P Space. Solving problems in NP is easier than solving trigonometric problems in P space, which involve constraints-like finding winning positions in chess.