Games on Random Boards


We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyse outcomes with optimal play on percolation clusters of Euclidean lattices. On Z with two different percolation parameters for odd and… (More)


8 Figures and Tables