Undirected edge geography games on grids

Abstract

The undirected edge geography is a two-player combinatorial game on an undirected rooted graph. The players alternatively perform a move consisting of choosing an edge incident to the root vertex, removing the chosen edge, and marking the other endpoint as a new root vertex. The first player who cannot perform a move is the loser. In this paper, we are interested in the undirected edge geography game on the grid graph $P_m\square P_n$. We completely determine all N-positions (the root vertices where the first player wins) and all P-positions (the root vertices where the first player loses). Moreover, we give a winning strategy for the winner.