The cited paper uses Genetic Programming (GP) to simulate a well known coordination game, replicating some of the results observed in experiments. This short note suggests that the results presented in the paper cited in the title can be obtained in a much simpler way, due to the action of random actions and selection only. I implemented the same environment as in the original model, replacing the GP originally used with randomly choosing agents. A simple selection mechanism removes least performing agents replacing them with new ones that choose their action randomly. The results obtained do not differ from the ones presented in the original paper. The model used for these notes is distributed as example model in Laboratory for Simulation Development.