We discuss discrete optimization methods for constructing what we refer to as structured knight’s tours: knight’s tours that are nearly symmetric, contain repeated geometric motifs, and/or express hidden (or in some cases, not so hidden) mathematical structures.