Modern software systems are highly configurable, often having huge configuration spaces with myriads of valid configurations. Exhaustive testing is therefore not feasible in practice. A common approach towards a representative set of test configurations is by sampling the configuration space uniformly at random. In this talk I will showcase algorithms to sample configuration spaces given as feature diagrams or compiled as binary decision diagrams and will discuss current research directions in the field.