Before revision:  We present an algorithm for the case where mutations are restricted to pure strategies . This is the first positive result for computation of ESS, as all prior results are computational hardness and no prior algorithms have been presented .
After revision:  We present an algorithm for the case where mutations are restricted to pure strategies , and present experiments on several game classes including random and a recently-proposed cancer model. Our algorithm is based on a mixed-integer non-convex feasibility program formulation, which constitutes the first general optimization formulation for this problem. It turns out that the vast majority of the games included in the experiments contain ESS with small support, and our algorithm is outperformed by a support-enumeration based approach. However we suspect our algorithm may be useful in the future as games are studied that have ESS with potentially larger and unknown support size .