Another example: Collision detection, finding the shortest path, and other physical-world problems are NP-Hard (as the number of dimensions increases, it gets r

Another example: Collision detection, finding the shortest path, and other physical-world problems are NP-Hard (as the number of dimensions increases, it gets really disgusting to find intersections and paths). But there are a large number of 3D games out there, because "3" is few-enough dimensions that we can compute it with modern computers really fast.