  There are infinitely many pretzel links with the same Alexander polynomial
(actually with trivial Alexander polynomial). By contrast, in this note we
revisit the Jones polynomial of pretzel links and prove that, given a natural
number S, there is only a finite number of pretzel links whose Jones
polynomials have span S.
  More concretely, we provide an algorithm useful for deciding whether or not a
given knot is pretzel. As an application we identify all the pretzel knots up
to nine crossings, proving in particular that $8_{12}$ is the first non-pretzel
knot.
