I recently heard of a game between two players "Line" and "Point" and wanted to look for more information on it. However, without knowing the name of it (if it has one) finding more information is hard, has anyone heard of it? Is there a winning strategy for one of the players?


The game is as follows, it is played on the unit disk $D^2$ in $\mathbb{R}^2$ with the point $p\_0 = (0,0)$ marked to begin with. Play alternates between L and P (starting with L) and on turn $n$ they do the following:


L chooses a new line $l\_n$ through point $p\_{n-1}$ and then P chooses a new point $p\_n$ on line $l\_n$ inside $D^2$.


This forms a sequence of points $(p\_n)\_{n = 1}^\infty$ in $D^2$. L wins if this sequence converges to a point in $D^2$, P wins if it does not.


As far as I can tell P has a winning strategy, but I my formal proof for this is a sketch at best.



Choosing lines and points in D^2
Line actually has a winning strategy: it can force a convergent sequence. The problem was posed and solved in the following paper:


J. Maly and M. Zeleny (2006), A note on Buczolich's solution of the Weil gradient problem: a construction based on an infinite game, [*Acta Mathematica Hungarica*, Vol. 113, pp. 145-158.](http://dx.doi.org/10.1007/s10474-006-0096-7)


