Students' solutions of enumerative combinatorial problems may be assessed along two main dimensions: the correctness of the solution and the method of enumeration. This study looks at the second dimension with reference to the Cartesian product of two sets, and at the 'odometer' combinatorial strategy defined by English (1991). Since we are not aware of any algorithm-based methods suitable for analysing combinatorial strategies on a large-scale sample, in this study we endeavour to formalize the odometer strategy and recommend a method of algorithm-based classification of solutions according to the strategy used. In the paper (1) odometer thinking is described using a formula based on its definition, and (2) constancy and cyclicity are characterized using mathematical formulae, which are then used to describe odometer thinking in a computationally efficient manner ('odometricality'). Our hypothesis, i.e. that odometer thinking may be approximated by the odometricality index, is successfully tested on a random sample of automatically generated solutions (n=10,000) by calculating the correlation between odometricality and the formal measure of odometer thinking. Finally, we offer a method (and R script) for classifying strategy use.