Infinite game of perfect information (source code)

= Infinite game of perfect information

For $A\subseteq M^\omega$, the game $G(A)$ has two players alternately choose elements of the move set $M$, producing $x\in M^\omega$. Player I wins exactly when $x\in A$. Both players see the whole finite position before making each move.