  Around 2001 we classified the Leonard systems up to isomorphism. The proof
was lengthy and involved considerable computation. In this paper we give a
proof that is shorter and involves minimal computation. We also give a
comprehensive descriptionof the intersection numbers of a Leonard system.
