A curl-free walk in Z 2 is a closed path crossing every edge the same number of times in both directions. A natural question is : what is the number of such walks on length n ? After giving a method to solve this problem, we will apply it to a toy-model and explain the connections with other objects, such that the Schrödinger equation with random potential, or the lamplighter group.