  In this paper, we address computational questions surrounding the enumeration
of non-isomorphic Andr\'e planes for any prime power order. We are particularly
focused on providing a complete enumeration of all such planes for relatively
small orders (up to 125), as well as developing computationally efficient ways
to count the number of isomorphism classes for other orders where enumeration
is infeasible. Andr\'e planes of all dimensions over their kernel are
considered.
