Trapping games on random boards
<p>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 analyze outcomes with optimal play on percolation clusters of Euclidean...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Institute of Mathematical Statistics (IMS)
2016
|