We provide an algorithm to generate minimal solutions to Euler’s six-squares problem. The method makes use of the theta series of the square lattice, the two-dimensional integer lattice. We also consider applications to generalizations of Euler’s problem. This talk should be easily accessible to undergraduates.