  We study the enumeration of different classes of grand knight's paths in the
plane. In particular, we focus on the subsets of zigzag knight's paths subject
to constraints. These constraints include ending at ordinate 0, bounded by a
horizontal line, confined within a tube, among other considerations. We present
our results using generating functions or direct closed-form expressions. We
derive asymptotic results, finding approximations for quantities such as the
probability that a zigzag knight's path stays in some area of the plane, or for
the average of the final height of such a path. Additionally, we exhibit some
bijections between grand zigzag knight's paths and some pairs of compositions.
