The polydiagonal compactification shares most properties of the Fulton-MacPherson space X[n], but the underlying combinatorics is different. In a sense, it is the maximal wonderful compactification (while X[n] is the minimal one). The construction itself is elementary and does not require any knowledge of X[n]. I will explain its basic features, including the canonical iterated blowdown map to X[n].