We show that the fact that the first player (“white”) wins every instance of Galvin’s “racing pawns” game (for countable trees) is equivalent to arithmetic transfinite recursion. Along the way we analyze the satisfaction relation for infinitary formulas, of “internal” hyperarithmetic comprehension, and of the law of excluded middle for such formulas.