Game Trees

Understanding the game constraints

Consider the following simple two-player game played on an $n × n$ square grid with a border of squares; let’s call the players Horace Fahlberg-Remsen and Vera Rebaudi. Each player has $n$ tokens that they move across the board from one side to the other. Horace’s tokens start in the left border, one in each row, and move horizontally to the right; symmetrically, Vera’s tokens start in the top border, one in each column, and move vertically downward. The players alternate turns. In each of his turns, Horace either moves one of his tokens one step to the right into an empty square or jumps one of his tokens over exactly one of Vera’s tokens into an empty square two steps to the right. If no legal moves or jumps are available, Horace simply passes. Similarly, Vera either moves or jumps one of her tokens downward in each of her turns, unless no moves or jumps are possible. The first player to move all their tokens off the edge of the board wins. (It’s not hard to prove that as long as there are tokens on the board, at least one player can legally move, and therefore, someone eventually wins.)