We will discuss a discretized version of a configuration space, which can be used to study discrete motions of several non-colliding points inside an underlying workspace. Many theorems about these spaces are parallel to the smooth case, but the additional combinatorial structure has further benefits. If the workspace is a graph, for instance, then the configuration spaces are non-positively curved. This has generalizations and applications to motion-planning and shape-planning problems in robotics.