In this game, you start with a square. Alice tries to connect the top side to the bottom side, and Bob tries to connect the left side to the right side, like in [Hex](https://en.wikipedia.org/wiki/Hex_(board_game)). Unlike in Hex, Alice and Bob use points instead of hexagons.


Now you might say that neither Alice nor Bob can win, since it is impossible to form a line using only finitely many points. Not so, for Alice and Bob can move infinitely many times!


In particular, let $S\_\alpha$ be the state of the board, where $\alpha$ is an ordinal. Then:


* If $\alpha=0$, then $S\_\alpha=\emptyset$.
* If $\alpha$ is a successor ordinal, then Alice adds $(\alpha,p,Alice)$, where $p$ is some point in $[0,1] \times [0,1]$ that has not already been played, to $S\_{\alpha-1}$, unless $S\_{\alpha-1}=[0,1] \times [0,1]$. She can use $S\_{\alpha-1}$ to inform her decision (in other words, Alice has a strategy function that given $S\_{\alpha-1}$, gives her move). Bob does likewise.
* If $\alpha$ is a limit ordinal, then $S\_\alpha = \bigcup\_{\beta<\alpha}S\_\beta$.


We say Alice has won if there for some $\alpha$, there is a path in $[0,1] \times [0,1]$, composed of points corresponding to Alice's moves, connecting the top and bottom. Bob wins likewise, (connecting the left and right side of the boards).


Since there are ordinals $\alpha$ such that $|\alpha| > |[0,1]\times[0,1]|$, the board must eventually be filled (in particular, it will happen *before* such an ordinal).


One thing to note is that Alice and Bob cannot *both* win, due to the [Jordan curve theorem](https://en.wikipedia.org/wiki/Jordan_curve_theorem). On the other hand, it is possible for neither of them to win. In this case, Alice would have no curve connecting the top and bottom, and Bob would have no curve connecting the sides.


My question is:


* Does Alice have a winning strategy? (Bob doesn't, due to a strategy stealing argument.)
* Does Alice or Bob have a drawing strategy (a strategy that guarantees either a win or a draw)? (If Bob does, so does Alice.)



Who wins infinite Hex?
Let $\mathfrak{c}$ denote the cardinality of real numbers and let $(C\_{\alpha}: \alpha < \mathfrak{c})$ be an enumeration of uncountable closed subsets of the unit square.


Let Bob's strategy be playing a point $q\_{\alpha} \in C\_{\alpha}$ not already chosen at stage $\alpha$ for $\alpha < \mathfrak{c}$. This is possible since, at stage $\alpha < \mathfrak{c}$, the players could have chosen only less than $\mathfrak{c}$ many points of the set $C\_{\alpha}$ which has cardinality $\mathfrak{c}$. Bob can do whatever he feels like for other ordinals.


Note that the game will proceed at least $\mathfrak{c}$ stages since any curve connecting opposite sides contains $\mathfrak{c}$ many points. Any curve $C$ witnessing the victory of a player would be necessarily of the form $C\_{\beta}$ for some $\beta < \mathfrak{c}$ and hence contains the point $q\_{\beta}$. Thus Bob guarantees not losing if he plays with this strategy. (Of course, by using this strategy, Alice can guarantee not losing as well.)


