We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a polynomial map is expansive on a neighbourhood of the Julia set, J. We show that the construction of such a metric proves the map is hyperbolic. We also examine the question of whether the algorithm can be improved, and the related question of how to build a metric close to Euclidean. Finally, we give several examples generated with our implementation of this algorithm.