In this article we compute analytically the number of Nash Equilibria (NE) for a two-choice game played on (circular) ladder graph with $2n$ players. We consider set games generic payoff parameters, only requirement that NE occurs if players choose opposite strategies (anti-coordination game). The results show both, and circular ladder, grows exponentially (half) $n$, as $N_{NE}(2n)\sim C(\varp...