Desargues theorem, its configurations, and the solution to a long-standing enumeration problem

We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.